Berlin 2012 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

DY: Fachverband Dynamik und Statistische Physik

DY 21: Granular Matter/Contact Dynamics

DY 21.10: Topical Talk

Wednesday, March 28, 2012, 16:45–17:15, MA 144

Algorithms in statistical physics: Percolation — •Stephan Mertens^1,2 and Cristopher Moore^2,3 — ¹Otto-von-Guericke Universität, Magdeburg, Germany — ²Santa Fe Institute, USA — ³University of New Mexico, Albuquerque, USA

Statistical physics is a field rich in algorithmic challenges. In this contribution we discuss algorithms for the percolation problem. In particular we present a simple algorithm for generating percolating clusters. The algorithm works on lattices as well as in continuous systems, in arbitrary dimensions and even for heterogeneous objects. Despite its simplicity and versatility, the algorithm runs in linear time, which is the optimum for algorithms that explicitly construct percolating clusters. We use the algorithm to compute values of the percolation thresholds for various continuous systems with unprecedented accuracy.