Width of percolation transition in complex networks
- 7 March 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 73 (3) , 035101
Abstract
It is known that the critical probability for the percolation transition is not a sharp threshold. Actually it is a region of nonzero width for systems of finite size. Here we present evidence that for complex networks , where is the average length of the percolation cluster, and is the number of nodes in the network. For Erdős-Rényi graphs , while for scale-free networks with a degree distribution and , . We show analytically and numerically that the survivability , which is the probability of a cluster to survive chemical shells at probability , behaves near criticality as . Thus for probabilities inside the region the behavior of the system is indistinguishable from that of the critical point.
Keywords
All Related Versions
This publication has 15 references indexed in Scilit:
- Threshold Effects for Two Pathogens Spreading on a NetworkPhysical Review Letters, 2005
- Evolution and Structure of the Internet2004
- Efficient Immunization Strategies for Computer Networks and PopulationsPhysical Review Letters, 2003
- Optimal Paths in Disordered Complex NetworksPhysical Review Letters, 2003
- Evolution of Networks2003
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Network Robustness and Fragility: Percolation on Random GraphsPhysical Review Letters, 2000
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- Fractals and Disordered Systems1996
- Cluster structure near the percolation thresholdJournal of Physics A: General Physics, 1982