Anomalous percolation properties of growing networks
- 19 November 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 64 (6) , 066110
- https://doi.org/10.1103/physreve.64.066110
Abstract
We describe the anomalous phase transition of the emergence of the giant connected component in scale-free networks growing under mechanism of preferential linking. We obtain exact results for the size of the giant connected component and the distribution of vertices among connected components. We show that all the derivatives of the giant connected component size S over the rate b of the emergence of new edges are zero at the percolation threshold and where the coefficient d is a function of the degree distribution exponent In the entire phase without the giant component, these networks are in a “critical state.” The probability that a vertex belongs to a connected component of a size k is of a power-law form. At the phase transition point, In the phase with the giant component, has an exponential cutoff at In the simplest particular case, we present exact results for growing exponential networks.
Keywords
All Related Versions
This publication has 28 references indexed in Scilit:
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Giant strongly connected component of directed networksPhysical Review E, 2001
- Breakdown of the Internet under Intentional AttackPhysical Review Letters, 2001
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- Epidemics and percolation in small-world networksPhysical Review E, 2000
- Scaling and percolation in the small-world network modelPhysical Review E, 1999
- Diameter of the World-Wide WebNature, 1999
- The Size of the Giant Component of a Random Graph with a Given Degree SequenceCombinatorics, Probability and Computing, 1998
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995