A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
The Degree Sequence of a Scale-Free Random Graph Process
[chapter]

2011
*
The Structure and Dynamics of Networks
*

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 γ =

doi:10.1515/9781400841356.384
fatcat:jhyn5z7hhjfyfimv6b6suyrtfe