Resilience to damage of graphs with degree correlations
Top Cited Papers
- 6 January 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 67 (1) , 015101
- https://doi.org/10.1103/physreve.67.015101
Abstract
The existence or nonexistence of a percolation threshold on power law correlated graphs is a fundamental question for which a general criterion is lacking. In this work we investigate the problems of site and bond percolation on graphs with degree correlations and their connection with spreading phenomena. We obtain some general expressions that allow the computation of the transition thresholds or their bounds. Using these results we study the effects of assortative and disassortative correlations on the resilience to damage of networks.Keywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Evolution of networksAdvances in Physics, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Random graphs with arbitrary degree distributions and their applicationsPhysical Review E, 2001
- Epidemic dynamics and endemic states in complex networksPhysical Review E, 2001
- How Viruses Spread Among Computers and PeopleScience, 2001
- Breakdown of the Internet under Intentional AttackPhysical Review Letters, 2001
- Epidemic Spreading in Scale-Free NetworksPhysical 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