Scale-free growing networks imply linear preferential attachment

It has been recognized for some time that a network grown by the addition of nodes with linear preferential attachment will possess a scale-free distribution of connectivities. Here we prove by some analytical arguments that the linearity is a necessary component to obtain this kind of distribution....

Full description

Saved in:
Bibliographic Details
Published inPhysical review. E, Statistical, nonlinear, and soft matter physics Vol. 65; no. 1 Pt 2; p. 017102
Main Authors Eriksen, Kasper Astrup, Hörnquist, Michael
Format Journal Article
LanguageEnglish
Published United States 01.01.2002
Online AccessGet more information

Cover

Loading…
More Information
Summary:It has been recognized for some time that a network grown by the addition of nodes with linear preferential attachment will possess a scale-free distribution of connectivities. Here we prove by some analytical arguments that the linearity is a necessary component to obtain this kind of distribution. However, the preferential linking rate does not necessarily apply to single nodes, but to groups of nodes of the same connectivity. We also point out that for a time-varying mean connectivity the linking rate will deviate from a linear expression by an extra asymptotically logarithmic term.
ISSN:1539-3755
DOI:10.1103/PhysRevE.65.017102