Exact percolation probabilities for a square lattice: Site percolation on a plane, cylinder, and torus
Renat K. Akhunzhanov, Andrei V. Eserkepov, Yuri Yu. Tarasevich

TL;DR
This paper derives exact polynomial expressions for site percolation probabilities on a square lattice for various topologies, providing new analytical tools and estimates for the percolation threshold up to moderate system sizes.
Contribution
The authors present a novel algorithm that efficiently computes exact percolation probability polynomials for finite square lattices on plane, cylinder, and torus topologies, including proofs of their properties.
Findings
Exact polynomials for percolation probabilities up to L=17 (plane)
Divisibility properties of the polynomials confirmed
Percolation threshold estimated as p_c=0.59269
Abstract
We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size 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 for a plane, up to for a cylinder, and up to 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
