Resilience to damage of graphs with degree correlations

2002/09/30 by Alexei Vázquez, Alexei Vazquez, Yamir Moreno · 3 citations
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Opinion Dynamics and Social Influence #Stochastic processes and statistical mechanics #cond-mat.dis-nn #cond-mat.stat-mech

paper · pdf · doi:10.1103/physreve.67.015101

published as Phys. Rev. E 67, 015101(R) (2003) · 4 pages, 1 figure

openalex publication_date 2003/01/06 · arxiv created 2003/01/07 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Error and attack tolerance of complex networks
• Ferromagnetic phase transition in Barabási–Albert networks
• Statistical mechanics of complex networks
• Evolution of networks

Cited by

• The unreasonable effectiveness of tree-based theory for networks with clustering
• Cut-offs and finite size effects in scale-free networks
• Clustering in complex networks. II. Percolation properties