Revisiting finite size effect of percolation in degree correlated networks

Abstract

In this study, we investigate bond percolation in networks that have the Poisson degree distribution and a nearest-neighbor degree-degree correlation. Previous numerical studies on percolation critical behaviors of degree-correlated networks remain controversial. We perform finite-size scaling for the peak values of the second-largest cluster size and the mean cluster size and find a large finite-size effect when a network has a strong degree-degree correlation. Evaluating the size dependence of estimated critical exponents carefully, we demonstrate that the bond percolation in the networks exhibits the mean-field critical behavior, independent of the strength of their nearest-neighbor degree correlations.

arXiv comment7 pages, 5 figures

References in corpus (13)

• Assortative mixing in networks
• Mixing patterns in networks
• Percolation on complex networks: Theory and application
• Percolation Critical Exponents in Scale-Free Networks
• Quantifying randomness in real networks
• Percolation on correlated networks
• Percolation transition in networks with degree-degree correlation
• Scaling of percolation transitions on Erdös-Rényi networks under centrality-based attacks
• A general formulation of long-range degree correlations in complex networks
• Effect of degree correlations above the first shell on the percolation transition
• Identification of intrinsic long-range degree correlations in complex networks
• Percolation on a maximally disassortative network
• Finite size scaling theory for percolation phase transition