This is the authors' abstract. We don't add key points for this paper.
Recently, Barabási and Albert [2] suggested modeling complex real‐world networks such as the worldwide web as follows: consider a random graph process in which vertices are added to the graph one at a time and joined to a fixed number of earlier vertices, selected with probabilities proportional to their degrees. In [2] and, with Jeong, in [3], Barabási and Albert suggested that after many steps the proportion P ( d ) of vertices with degree d should obey a power law P ( d )α d −γ . They obtained γ=2.9±0.1 by experiment and gave a simple heuristic argument suggesting that γ=3. Here we obtain P ( d ) asymptotically for all d ≤ n 1/15 , where n is the number of vertices, proving as a consequence that γ=3.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Bollobás et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: