Densification and Structural Transitions in Networks that Grow by Node Copying
arXiv:1610.01662 · doi:10.1103/PhysRevE.94.062302
Abstract
We introduce a growing network model---the copying model---in which a new node attaches to a randomly selected target node and, in addition, independently to each of the neighbors of the target with copying probability . When , this algorithm generates sparse networks, in which the average node degree is finite. A power-law degree distribution also arises, with a non-universal exponent whose value is determined by a transcendental equation in . In the sparse regime, the network is "normal", e.g., the relative fluctuations in the number of links are asymptotically negligible. For , the emergent networks are dense (the average degree increases with the number of nodes ) and they exhibit intriguing structural behaviors. In particular, the -dependence of the number of -cliques (complete subgraphs of nodes) undergoes transitions from normal to progressively more anomalous behavior at a -dependent critical values of . Different realizations of the network, which start from the same initial state, exhibit macroscopic fluctuations in the thermodynamic limit---absence of self averaging. When linking to second neighbors of the target node can occur, the number of links asymptotically grows as as , so that the network is effectively complete as .
15 pages, 12 figures
References in corpus (7)
- Fast unfolding of communities in large networks
- Benchmark graphs for testing community detection algorithms
- Triadic closure as a basic generating mechanism of communities in complex networks
- Structural Transitions in Dense Networks
- Scale Free Networks from Self-Organisation
- Exact Solution for the Time Evolution of Network Rewiring Models
- Accelerating networks