Percolation and Epidemic Thresholds in Clustered Networks
Open Access
- 23 August 2006
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 97 (8) , 088701
- https://doi.org/10.1103/physrevlett.97.088701
Abstract
We develop a theoretical approach to percolation in random clustered networks. We find that, although clustering in scale-free networks can strongly affect some percolation properties, such as the size and the resilience of the giant connected component, it cannot restore a finite percolation threshold. In turn, this implies the absence of an epidemic threshold in this class of networks, thus extending this result to a wide variety of real scale-free networks which shows a high level of transitivity. Our findings are in good agreement with numerical simulations.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Evolution and Structure of the InternetPublished by Cambridge University Press (CUP) ,2004
- Epidemics, disorder, and percolationPhysica A: Statistical Mechanics and its Applications, 2003
- Evolution of NetworksPublished by Oxford University Press (OUP) ,2003
- Percolation on heterogeneous networks as a model for epidemicsMathematical Biosciences, 2002
- Percolation critical exponents in scale-free networksPhysical Review E, 2002
- Spread of epidemic disease on networksPhysical Review E, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Resilience of the Internet to Random BreakdownsPhysical Review Letters, 2000
- On the critical behavior of the general epidemic process and dynamical percolationMathematical Biosciences, 1983
- A contribution to the mathematical theory of epidemicsProceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character, 1927