Percolation critical exponents in scale-free networks
- 17 September 2002
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 66 (3) , 036113
- https://doi.org/10.1103/physreve.66.036113
Abstract
We study the behavior of scale-free networks, having connectivity distribution close to the percolation threshold. We show that for networks with known to undergo a transition at a finite threshold of dilution, the critical exponents are different than the expected mean-field values of regular percolation in infinite dimensions. Networks with possess only a percolative phase. Nevertheless, we show that in this case percolation critical exponents are well defined, near the limit of extreme dilution (where all sites are removed), and that also then the exponents bear a strong dependence. The regular mean-field values are recovered only for
Keywords
All Related Versions
This publication has 13 references indexed in Scilit:
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Anomalous percolation properties of growing networksPhysical Review E, 2001
- Statistical ensemble of scale-free random graphsPhysical Review E, 2001
- Are randomly grown graphs really random?Physical Review E, 2001
- Random graphs with arbitrary degree distributions and their applicationsPhysical 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
- Error and attack tolerance of complex networksNature, 2000
- A critical point for random graphs with a given degree sequenceRandom Structures & Algorithms, 1995