# Faster calculation of the percolation correlation length on spatial networks

## TL;DR

This paper introduces a novel, efficient algorithm that leverages the parallel axis theorem and disjoint sets to accurately measure the correlation length during percolation processes in spatial networks, enhancing understanding of critical phenomena.

## Contribution

The authors develop a new algorithm that allows for precise, single-pass measurement of the correlation length in spatial networks during percolation, improving upon existing methods.

## Key findings

- Enables measurement of correlation length with arbitrary precision
- Works for lattices and spatial network topologies
- Provides a tool for studying critical phenomena

## 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.