Exact percolation probabilities for a square lattice: Site percolation on a plane, cylinder, and torus

Abstract

We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size $L\times L$ sites when considering a plane (the crossing probability in a given direction), a cylinder (spanning probability), and a torus (wrapping probability along one direction). Since some polynomials are extremely cumbersome, they are presented as separate files in Supplemental material. The system sizes for which this was feasible varied up to $L=17$ for a plane, up to $L=16$ for a cylinder, and up to $L=12$ for a torus. To obtain a percolation probability polynomial, all possible combinations of occupied and empty sites have to be taken into account. However, using dynamic programming along with some ideas related to the topology, we offer an algorithm which allows a significant reduction in the number of configurations requiring consideration. A rigorous formal description of the algorithm is presented. Divisibility properties of the polynomials have been rigorously proved. Reliability of the polynomials obtained have been confirmed by the divisibility tests. The wrapping probability polynomials on a torus provide a better estimate of the percolation threshold than that from the spanning probability polynomials. Surprisingly, even a naive finite size scaling analysis allows an estimate to be obtained of the percolation threshold $p_c=0.59269$.

arXiv comment18 pages, 39 references, 8 figures, 2 tables, supplement, accepted manuscript in J. Phys. A: Fine Latticework: Celebrating the Craftsmanship of Robert M. Ziff in Honour of his 70th Birthday https://iopscience.iop.org/journal/1751-8121/page/fine-latticework

References in corpus (18)

• A fast Monte Carlo algorithm for site or bond percolation
• Efficient Monte Carlo algorithm and high-precision results for percolation
• Critical Percolation in Finite Geometries
• Percolation on complex networks: Theory and application
• Continuum Percolation Thresholds in Two Dimensions
• A crossing probability for critical percolation in two dimensions
• Convergence of threshold estimates for two-dimensional percolation
• Percolation and the pandemic
• Percolation Crossing Formulas and Conformal Field Theory
• Critical polynomials in the nonplanar and continuum percolation models
• Bond percolation thresholds on Archimedean lattices from critical polynomial roots
• Percolation in Finite Matching Lattices
• A formula for crossing probabilities of critical systems inside polygons
• The percolation critical polynomial as a graph invariant
• Universal features of cluster numbers in percolation
• Exact Percolation Probability on the Square Lattice
• Percolation is Odd
• The computation of generalized percolation critical polynomials by the deletion-contraction algorithm

Cited by in corpus (2)

• Random site percolation on honeycomb lattices with complex neighborhoods
• Lower limit of percolation threshold on a square lattice with complex neighborhoods