A fast algorithm for backbones

TL;DR

This paper introduces a rapid matching algorithm for identifying backbones in percolation problems, enabling the analysis of significantly larger systems than previous methods.

Contribution

The paper presents a novel, faster algorithm for backbone identification in percolation systems, allowing large-scale analysis beyond prior computational limits.

Findings

Able to analyze systems with 1.7x10^7 sites, two orders of magnitude larger than previous methods.

Provides efficient backbone detection in higher-dimensional percolation models.

Enhances understanding of percolation backbones in large systems.

Abstract

A matching algorithm for the identification of backbones in percolation problems is introduced. Using this procedure, percolation backbones are studied in two- to five-dimensional systems containing 1.7x10^7 sites, two orders of magnitude larger than was previously possible using burning algorithms.