A random graph of moderate density
A random graph of moderate density
We analyse a randomly growing graph model in which the average degree is asymptotically equal to a constant times the square root of the number of vertices, and the clustering coefficient is rather small. In every step, we choose two vertices uniformly at random, check whether they are connected or …