Choice-Driven Phase Transition in Complex Networks
arXiv:1312.7803 · doi:10.1088/1742-5468/2014/04/P04021
Abstract
We investigate choice-driven network growth. In this model, nodes are added one by one according to the following procedure: for each addition event a set of target nodes is selected, each according to linear preferential attachment, and a new node attaches to the target with the highest degree. Depending on precise details of the attachment rule, the resulting networks has three possible outcomes: (i) a non-universal power-law degree distribution; (ii) a single macroscopic hub (a node whose degree is of the order of N, the number of network nodes), while the remainder of the nodes comprises a non-universal power-law degree distribution; (iii) a degree distribution that decays as (k ln k)^{-2} at the transition between cases (i) and (ii). These properties are robust when attachment occurs to the highest-degree node from at least two targets. When attachment is made to a target whose degree is not the highest, the degree distribution has the ultra-narrow double-exponential form exp(-const. x e^k), from which the largest degree grows only as ln(ln N).
arXiv comment15 pages, 4 figures, IOP format. Version 2 contains various minor corrections; to appear in JSTAT
References in corpus (17)
- Statistical mechanics of complex networks
- Organization of Growing Random Networks
- "Explosive Percolation" Transition is Actually Continuous
- Explosive Percolation is Continuous, but with Unusual Finite Size Behavior
- Explosive percolation in scale-free networks
- Percolation Transitions in Scale-Free Networks under Achlioptas Process
- Construction and Analysis of Random Networks with Explosive Percolation
- Explosive percolation: a numerical analysis
- Finiteness and Fluctuations in Growing Networks
- Local cluster aggregation models of explosive percolation
- Scaling behavior of explosive percolation on the square lattice
- Achlioptas process phase transitions are continuous
- On the maximum queue length in the supermarket model
- The power of choice in network growth
- Controlling Self-Organizing Dynamics on Networks Using Models that Self-Organize
- Finite-size scaling theory for explosive percolation transitions
- On the power of two choices: Balls and bins in continuous time
Cited by in corpus (7)
- Preferential attachment with choice
- Random Recursive Hypergraphs
- Preferential attachment with location-based choice: Degree distribution in the noncondensation phase
- Condensation in preferential attachment models with location-based choice
- Preferential attachment with fitness dependent choice
- Kinetics of Aggregation with Choice
- High degree vertices in the Power of Choice model combined with Preferential Attachment