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.7x10^7 sites, two orders of magnitude larger than was previously possible using burning algorithms.

8 pages, 6 .eps figures. Uses epsfig and ijmpc.sty (included). To appear in Int. J. Mod. Phys. C

Cited by in corpus (17)

• Statistical Models of Fracture
• A fast Monte Carlo algorithm for site or bond percolation
• Floppy modes and the free energy: Rigidity and connectivity percolation on Bethe Lattices
• Multifractality of self-avoiding walks on percolation clusters
• Scaling behavior of self-avoiding walks on percolation clusters
• Critical percolation clusters in seven dimensions and on a complete graph
• Diluted Networks of Nonlinear Resistors and Fractal Dimensions of Percolation Clusters
• Walking on fractals: diffusion and self-avoiding walks on percolation clusters
• Noisy random resistor networks: renormalized field theory for the multifractal moments of the current distribution
• Transport on percolation clusters with power-law distributed bond strengths: when do blobs matter?
• Critical exponents and universal excess cluster number of percolation in four and five dimensions
• Polymers in crowded environment under stretching force: globule-coil transitions
• Rapid algorithm for identifying backbones in the two-dimensional percolation model
• Fractal Dimension of 3-Blocks in 4d, 5d, and 6d Percolation Systems
• Random nanowire networks: Identification of a current-carrying subset of wires using a modified wall follower algorithm
• Identification of a current-carrying subset of a percolation cluster using a modified wall follower algorithm
• Universality and non-universality in behavior of self-repairing random networks