Faster calculation of the percolation correlation length on spatial networks

Abstract

The divergence of the correlation length $\xi$ at criticality is an important phenomenon of percolation in two-dimensional systems. Substantial speed-ups to the calculation of the percolation threshold and component distribution have been achieved by utilizing disjoint sets, but existing algorithms of this sort cannot measure the correlation length. Here, we utilize the parallel axis theorem to track the correlation length as nodes are added to the system, allowing us to utilize disjoint sets to measure $\xi$ for the entire percolation process with arbitrary precision in a single sweep. This algorithm enables direct measurement of the correlation length in lattices as well as spatial network topologies, and provides an important tool for understanding critical phenomena in spatial systems.

References in corpus (9)

• Error and attack tolerance of complex networks
• Catastrophic cascade of failures in interdependent networks
• Resilience of the Internet to random breakdowns
• A fast Monte Carlo algorithm for site or bond percolation
• Efficient Monte Carlo algorithm and high-precision results for percolation
• Spatially localized attacks on interdependent networks: the existence of a finite critical attack size
• Two distinct transitions in spatially embedded multiplex networks
• Spreading of localized attacks in spatial multiplex networks
• Critical stretching of mean-field regimes in spatial networks

Cited by in corpus (3)

• $N$-cluster correlations in four- and five-dimensional percolation
• Percolation on spatial anisotropic networks
• Interdependent transport via percolation backbones in spatial networks