Scale-free growing networks imply linear preferential attachment
Abstract
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.
- Publication:
-
Physical Review E
- Pub Date:
- December 2001
- DOI:
- 10.1103/PhysRevE.65.017102
- Bibcode:
- 2001PhRvE..65a7102E
- Keywords:
-
- 89.75.Hc;
- 02.50.Ey;
- 05.65.+b;
- 89.75.Da;
- Networks and genealogical trees;
- Stochastic processes;
- Self-organized systems;
- Systems obeying scaling laws