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

  title={Scale-free networks as pre-asymptotic regimes of super-linear preferential attachment},
  author={Paul L. Krapivsky and Dmitri V. Krioukov},
  journal={Physical review. E, Statistical, nonlinear, and soft matter physics},
  volume={78 2 Pt 2},
  • P. Krapivsky, Dmitri V. Krioukov
  • Published 2008
  • Mathematics, Medicine, Physics, Computer Science
  • Physical review. E, Statistical, nonlinear, and soft matter physics
We study the following paradox associated with networks growing according to superlinear preferential attachment: superlinear preference cannot produce scale-free networks in the thermodynamic limit, but there are superlinearly growing network models that perfectly match the structure of some real scale-free networks, such as the Internet. We obtain an analytic solution, supported by extensive simulations, for the degree distribution in superlinearly growing networks with arbitrary average… Expand
Preferential attachment in online networks: measurement and explanations
An empirical study of the preferential attachment phenomenon in temporal networks is performed and it is shown that on the Web, networks follow a nonlinear preferential attachment model in which the exponent depends on the type of network considered, including directed, undirected and bipartite networks. Expand
Sublinear but Never Superlinear Preferential Attachment by Local Network Growth
It is shown that when r is a decaying function of the degree of the parent of the initial target, the redirection algorithm produces sublinear preferential attachment network growth and it is argued that no local red Directional Algorithm can produce super linear preferential attachment. Expand
Emergent Network Modularity
A network growth model based on complete redirection is introduced: a new node randomly selects an existing target node, but attaches to a random neighbor of this target, which generates unusual, highly modular networks. Expand
Highly dispersed networks generated by enhanced redirection
We analyze growing networks that are built by enhanced redirection. Nodes are sequentially added and each incoming node attaches to a randomly chosen 'target' node with probability 1 − r, or to theExpand
Scale-free Networks Well Done
A rigorous definition of power-law distributions is provided, equivalent to the definition of regularly varying distributions that are widely used in statistics and other fields, and three estimators of these exponents are identified that are proven to be statistically consistent. Expand
Ensembles related to the rich-club coefficient for non-evolving networks
In complex networks the rich nodes are the subset of nodes with high degree. These well connected nodes tend to dominate the organisation of the network's structure. In non-evolving networks, aExpand
Mechanisms of complex network growth: Synthesis of the preferential attachment and fitness models.
The fitness model yields the long-sought explanation for the initial attractivity K_{0}, an elusive parameter which was left unexplained within the framework of the preferential attachment model, and it is shown that theInitial attractivity is determined by the width of the fitness distribution. Expand
Ensembles of reference networks based on the rich–club structure for non–evolving networks
In networks the rich nodes are the subset of nodes with large numbers of links, or high degrees. The rich nodes and the connectivity between themselves (rich–club connectivity) tend to dominate theExpand
Random ancestor trees
We investigate a network growth model in which the genealogy controls the evolution. In this model, a new node selects a random target node and links either to this target node, or to its parent, orExpand
Exploring the topology and dynamic growth properties of co-invention networks and technology fields
Evidence that inventors tend to diversify into new fields that are less mature is found, and this behavior appears to be correlated with the compliance of some of the expected network rules and has implications for the emerging patterns among the different collaboration networks under consideration here. Expand


Connectivity Transitions in Networks with Super-Linear Preferential Attachment
We analyze an evolving network model of Krapivsky and Redner in which new nodes arrive sequentially, each connecting to a previously existing node b with probability proportional to the pth power ofExpand
Structural constraints in complex networks
We present a link rewiring mechanism to produce surrogates of a network where both the degree distribution and the rich-club connectivity are preserved. We consider three real networks, theExpand
Cut-offs and finite size effects in scale-free networks
Abstract.We analyze the degree distribution’s cut-off in finite size scale-free networks. We show that the cut-off behavior with the number of vertices N is ruled by the topological constraintsExpand
Organization of growing random networks.
  • P. Krapivsky, S. Redner
  • Mathematics, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2001
The organizational development of growing random networks is investigated, and the combined age and degree distribution of nodes shows that old nodes typically have a large degree. Expand
On the emergence of highly variable distributions in the autonomous system topology
This paper constructs a model incorporating exponential growth in the size of the Internet and in the number of ASes, and shows that it yields a size distribution exhibiting a power-law tail and instantiates such a model with empirically derived estimates of historical growth rates and the resulting degree distribution is in good agreement with that of real AS graphs. Expand
Self-similarity of complex networks and hidden metric spaces
These findings indicate that hidden geometries underlying these real networks are a plausible explanation for their observed topologies and, in particular, for their self-similarity with respect to the degree-based renormalization. Expand
Emergence of scaling in random networks
A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems. Expand
Finiteness and fluctuations in growing networks
We study the role of finiteness and fluctuations about average quantities for basic structural properties of growing networks. We first determine the exact degree distribution of finite networks byExpand
Accurately modeling the Internet topology
  • Shi Zhou, R. Mondragón
  • Computer Science, Medicine
  • Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
The positive-feedback preference (PFP) model is introduced which accurately reproduces many topological properties of the AS-level internet, including degree distribution, rich-club connectivity, the maximum degree, shortest path length, short cycles, disassortative mixing, and betweenness centrality. Expand
Connectivity of growing random networks.
A solution for the time- and age-dependent connectivity distribution of a growing random network is presented and the power law N(k) approximately k(-nu) is found, where the exponent nu can be tuned to any value in the range 2. Expand