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 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 mean-field. These findings highlight the need for new approaches, beyond the heterogeneous mean-field theory, to accurately describe phase transitions in complex networks with realistic topological features.