Growing Networks with Super-Joiners
arXiv:1405.7018 · doi:10.1103/PhysRevE.90.052812
Abstract
We study the Krapivsky-Redner (KR) network growth model but where new nodes can connect to any number of existing nodes, , picked from a power-law distribution . Each of the new connections is still carried out as in the KR model with probability redirection (corresponding to degree exponent , in the original KR model). The possibility to connect to any number of nodes resembles a more realistic type of growth in several settings, such as social networks, routers networks, and networks of citations. Here we focus on the in-, out-, and total-degree distributions and on the potential tension between the degree exponent , characterizing new connections (outgoing links), and the degree exponent dictated by the redirection mechanism.
arXiv comment10 pages, 5 figures
References in corpus (19)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Synchronization in complex networks
- Critical phenomena in complex networks
- Structure of Growing Networks: Exact Solution of the Barabasi--Albert's Model
- The complex network of global cargo ship movements
- Organization of Growing Random Networks
- Optimal Dynamical Range of Excitable Networks at Criticality
- The Dynamics of a Mobile Phone Network
- Predicting criticality and dynamic range in complex networks: effects of topology
- Infinite-Order Percolation and Giant Fluctuations in a Protein Interaction Network
- Network synchronization landscape reveals compensatory structures, quantization, and the positive effect of negative interactions
- Log-Networks
- Optimal synchronization of complex networks
- Finiteness and Fluctuations in Growing Networks
- Statistics of Cycles: How Loopy is your Network?
- Designer Nets from Local Strategies
- Sustainable growth in complex networks