Skip to Content
[CAIDA - Center for Applied Internet Data Analysis logo]
Center for Applied Internet Data Analysis > publications : papers : 2008 : scale_free_pre_asymptotic
Scale-free networks as pre-asymptotic regimes of super-linear preferential attachment
P. Krapivsky and D. Krioukov, "Scale-free networks as pre-asymptotic regimes of super-linear preferential attachment", Physical Review E, vol. 78, no. 026114, Aug 2008.
|   View full paper:    PDF    DOI    |  Citation:    BibTeX   |

Scale-free networks as pre-asymptotic regimes of super-linear preferential attachment

Paul Krapivsky 2
Dmitri Krioukov 1

CAIDA, San Diego Supercomputer Center, University of California San Diego


Department of Physics, Boston University

We study the following paradox associated with networks growing according to super-linear preferential attachment: super-linear preference cannot produce scale-free networks in the thermodynamic limit, but there are super-linearly growing network models that perfectly match the structure of some real scale-free networks, such as the Internet. We calculate the degree distribution in super-linearly growing networks with arbitrary average degree, and confirm that in the true thermodynamic limit, these networks are indeed degenerate, i.e., almost all nodes have low degrees. We then show that super-linear growth has vast pre-asymptotic regimes whose depths depend both on the average degree in the network and on how super-linear the preference kernel is. We demonstrate that a super-linearly growing network model can reproduce, in its pre-asymptotic regime, the structure of a real network, if the model captures some sufficiently strong structural constraints -- rich-club connectivity, for example. These findings suggest that real scale-free networks of finite size may exist in pre-asymptotic regimes of network evolution processes that lead to degenerate network formations in the thermodynamic limit.

Keywords: topology
  Last Modified: Wed Oct-11-2017 17:03:54 PDT
  Page URL: