A fast cluster counting algorithm for percolation on and off lattices

DOI10.1016/S0010-4655(97)00142-2zbMath0962.82035OpenAlexW2061130383MaRDI QIDQ1299578

Erich P. Stoll

Publication date: 18 June 2001

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0010-4655(97)00142-2

zbMATH Keywords

Monte Carlostochastic processesphase transitionspercolationcomputer simulationfractalsdroplet model

Mathematics Subject Classification ID

Phase transitions (general) in equilibrium statistical mechanics (82B26) Percolation (82B43)

Related Items (2)

Algorithm for identification of infinite clusters based on minimal finite automaton ⋮ SPIN AND SPIN–SPIN CORRELATIONS IN CHARGINO PAIR PRODUCTION AT FUTURE LINEAR e⁺e^- COLLIDERS

Cites Work

• Parallel algorithms in computational science

This page was built for publication: A fast cluster counting algorithm for percolation on and off lattices