Continuum percolation thresholds in two dimensions
Open Access
- 7 December 2012
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 86 (6) , 061109
Abstract
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the connected clusters, and (in two dimensions) using exact values from conformal field theory for the probability, at the phase transition, that various kinds of wrapping clusters exist on the torus. We apply this approach to percolation in continuum models, finding overlaps between objects with real-valued positions and orientations. In particular, we find precise values of the percolation transition for disks, squares, rotated squares, and rotated sticks in two dimensions and confirm that these transitions behave as conformal field theory predicts. The running time and memory use of our algorithm are essentially linear as a function of the number of objects at criticality.Keywords
All Related Versions
Funding Information
- National Science Foundation
This publication has 14 references indexed in Scilit:
- Finite-size scaling in stick percolationPhysical Review E, 2009
- Asymmetry in the percolation thresholds of fully penetrable disks with two different radiiPhysical Review E, 2007
- Continuum percolation with steps in the square or the discRandom Structures & Algorithms, 2005
- Continuum percolation threshold for interpenetrating squares and cubesPhysical Review E, 2002
- Fast Monte Carlo algorithm for site or bond percolationPhysical Review E, 2001
- Invaded cluster algorithm for Potts modelsPhysical Review E, 1996
- Scaling and universality in the spanning probability for percolationPhysical Review E, 1996
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- Random Plane NetworksJournal of the Society for Industrial and Applied Mathematics, 1961