Degree-dependent network growth: From preferential attachment to explosive percolation
arXiv:1310.1703 · doi:10.1103/PhysRevE.89.042815
Abstract
We present a simple model of network growth and solve it by writing down the dynamic equations for its macroscopic characteristics like the degree distribution and degree correlations. This allows us to study carefully the percolation transition using a generating functions theory. The model considers a network with a fixed number of nodes wherein links are introduced using degree-dependent linking probabilities . To illustrate the techniques and support our findings using Monte-Carlo simulations, we introduce the exemplary linking rule proportional to , with between -1 and plus infinity. This parameter may be used to interpolate between different regimes. For negative , links are most likely attached to high-degree nodes. On the other hand, in case , nodes with low degrees are connected and the model asymptotically approaches a process undergoing explosive percolation.
arXiv comment22 pages, 10 figures
References in corpus (30)
- Emergence of scaling in random networks
- The structure and function of complex networks
- Random graphs with arbitrary degree distributions and their applications
- Mixing patterns in networks
- Resilience of the Internet to random breakdowns
- Mean-field theory for scale-free random networks
- Critical phenomena in complex networks
- Connectivity of Growing Random Networks
- Organization of Growing Random Networks
- Weighted evolving networks: coupling topology and weights dynamics
- "Explosive Percolation" Transition is Actually Continuous
- Resilience to damage of graphs with degree correlations
- Second look at the spread of epidemics on networks
- Impact of Single Links in Competitive Percolation -- How complex networks grow under competition
- Self-organized adaptation of a simple neural circuit enables complex robot behaviour
- Explosive Percolation is Continuous, but with Unusual Finite Size Behavior
- Explosive percolation in scale-free networks
- Percolation on correlated networks
- Construction and Analysis of Random Networks with Explosive Percolation
- From Scale-free to Erdos-Renyi Networks
- Critical phenomena in networks
- How to make a fragile network robust and vice versa
- Rate equation approach for correlations in growing network models
- Cluster aggregation model for discontinuous percolation transition
- A new route to Explosive Percolation
- Continuity of the Explosive Percolation Transition
- A Hamiltonian approach for explosive percolation
- Biased Percolation on Scale-free Networks
- Criterion for explosive percolation transitions on complex networks
- Percolation on bipartite scale-free networks