542 citations · 2.9k across the 29 of their papers we have counts for
1 paper · 1 filter
S. N. Dorogovtsev, A. V. Goltsev, J. F. F. Mendes
We find that scale-free random networks are excellently modeled by a deterministic graph. This graph has a discrete degree distribution (degree is the number of connections of a ve…