Numerical evaluation of the upper critical dimension of percolation in scale-free networks

Abstract

We propose a numerical method to evaluate the upper critical dimension $d_c$ of random percolation clusters in Erdős-Rényi networks and in scale-free networks with degree distribution ${\cal P}(k) \sim k^{-λ}$, where $k$ is the degree of a node and $λ$ is the broadness of the degree distribution. Our results report the theoretical prediction, $d_c = 2(λ- 1)/(λ- 3)$ for scale-free networks with $3 < λ< 4$ and $d_c = 6$ for Erdős-Rényi networks and scale-free networks with $λ> 4$. When the removal of nodes is not random but targeted on removing the highest degree nodes we obtain $d_c = 6$ for all $λ> 2$. Our method also yields a better numerical evaluation of the critical percolation threshold, $p_c$, for scale-free networks. Our results suggest that the finite size effects increases when $λ$ approaches 3 from above.

10 pages, 5 figures