A fast algorithm for backbones
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.7x107 sites, two orders of magnitude larger than was previously possible using burning algorithms.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.