Numerical assessment of the percolation threshold using complement networks

N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Models of percolation processes on networks currently assume locally tree-like structures at low densities, and are derived exactly only in the thermodynamic limit. Finite size effects and the presence of short loops in real systems however cause a deviation between the empirical percolation threshold pc and its model-predicted value πc. Here we show the existence of an empirical linear relation between pc and πc across a large number of real and model networks. Such a putatively universal relation can then be used to correct the estimated value of πc. We further show how to obtain a more precise relation using the concept of the complement graph, by investigating on the connection between the percolation threshold of a network, pc, and that of its complement, pc.

Author supplied keywords

Cite

CITATION STYLE

APA

Rapisardi, G., Caldarelli, G., & Cimini, G. (2019). Numerical assessment of the percolation threshold using complement networks. In Studies in Computational Intelligence (Vol. 812, pp. 820–827). Springer Verlag. https://doi.org/10.1007/978-3-030-05411-3_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free