Generating graphs with traditional techniques
Traditional graph generation techniques have been studied for decades. This is why they are well understood and can be used as baselines in various applications. However, they are often limited in the type of graphs they can generate. Most of them are specialized to output certain topologies, which is why they cannot simply imitate a given network.
In this section, we will introduce two classical techniques: the Erdős–Rényi and the small-world models.
The Erdős–Rényi model
The Erdős–Rényi model is the simplest and most popular random graph model. It was introduced by Hungarian mathematicians Paul Erdős and Alfréd Rényi in 1959 [1] and was independently proposed by Edgar Gilbert the same year [2]. This model has two variants: 
and 
.
The 
model is straightforward: we are given 
nodes and a probability 
of connecting a pair of nodes. We try to randomly connect...
