How universal is the mean-field universality class for percolation in complex networks?

Abstract

Clustering and degree correlations are ubiquitous in real-world complex networks. Yet, understanding their role in critical phenomena remains a challenge for theoretical studies. Here, we provide the exact solution of site percolation in a model for strongly clustered random graphs, with many overlapping loops and heterogeneous degree distribution. We systematically compare the exact solution with heterogeneous mean-field predictions obtained from a treelike random rewiring of the network, which preserves only the degree sequence. Our results demonstrate a nontrivial interplay between degree heterogeneity, correlations and network topology, which can significantly alter both the percolation threshold and the critical exponents predicted by the heterogeneous mean-field. These findings reveal limitations of heterogeneous mean-field theory, demonstrating that the degree distribution alone is insufficient to determine universality classes in complex networks with realistic structural features.

7 pages, 3 figures + supplementary material

References in corpus (15)

• Catastrophic cascade of failures in interdependent networks
• Network robustness and fragility: Percolation on random graphs
• Critical phenomena in complex networks
• Random graphs with clustering
• Percolation Critical Exponents in Scale-Free Networks
• Second look at the spread of epidemics on networks
• Percolation and Epidemic Thresholds in Clustered Networks
• Recent advances and open challenges in percolation
• Percolation on correlated networks
• Critical phenomena in networks
• Message passing on networks with loops
• General and exact approach to percolation on random graphs
• Extended-range percolation in complex networks
• Strongly clustered random graphs via triadic closure: An exactly solvable model
• Bethe $M$-layer construction for the percolation problem