Continuum Percolation Thresholds in Two Dimensions

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.

[1]  Gary A. Talbot Applications of Percolation Theory , 1995 .

[2]  J. Quintanilla,et al.  Asymmetry in the percolation thresholds of fully penetrable disks with two different radii. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  Youjin Deng,et al.  Percolation in the canonical ensemble , 2012, 1210.3463.

[4]  E. N. Gilbert,et al.  Random Plane Networks , 1961 .

[5]  Chayes,et al.  Invaded cluster algorithm for Potts models. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[6]  Haru T. Pinson Critical percolation on the torus , 1994 .

[7]  M. Sahini,et al.  Applications of Percolation Theory , 2023, Applied Mathematical Sciences.

[8]  M. Newman,et al.  Fast Monte Carlo algorithm for site or bond percolation. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  S Torquato,et al.  Effect of dimensionality on the continuum percolation of overlapping hyperspheres and hypercubes. II. Simulation results and analyses. , 2012, The Journal of chemical physics.

[10]  Shi-Li Zhang,et al.  Finite-size scaling in stick percolation. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Aharony,et al.  Scaling and universality in the spanning probability for percolation. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

[12]  Sameet Sreenivasan,et al.  Continuum percolation threshold for interpenetrating squares and cubes. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[14]  Journal of Chemical Physics , 1932, Nature.

[15]  Journal of the Association for Computing Machinery , 1961, Nature.

[16]  Robert E. Tarjan,et al.  Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[17]  Cristopher Moore,et al.  The Nature of Computation , 2011 .

[18]  Jan van Leeuwen,et al.  Worst-case Analysis of Set Union Algorithms , 1984, JACM.