arXiv · cond-mat/0205476
Scale-Free Networks are Ultrasmall
Abstract
We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) ~ k^-a, i.e. the probability of having k links outgoing from a site. In contrast to the diameter of regular random networks or small world networks which is known to be d ~ lnN, we show, using analytical arguments, that scale free networks with 2 3, d ~ lnN. We also show that, for any a>2, one can construct a deterministic scale free network with d ~ lnlnN, and this construction yields the lowest possible diameter.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Reuven Cohen, Shlomo Havlin. 2003-02-05. Scale-Free Networks are Ultrasmall. https://doi.org/10.1103/physrevlett.90.058701
Cite the original work for its findings. Save a collection to share your selection of sources.