Callaway, D. S.; Hopcroft, J. E.; Kleinberg, J. M.; … - Santa Fe Institute - 2001
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability \delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time steps. In the limit of large t, the resulting graph displays...