Exact Percolation Probability on the Square Lattice
arXiv:2109.12102 · doi:10.1088/1751-8121/ac4195
Abstract
We present an algorithm to compute the exact probability for a site percolation cluster to span an square lattice at occupancy . The algorithm has time and space complexity with . It allows us to compute up to . We use the data to compute estimates for the percolation threshold that are several orders of magnitude more precise than estimates based on Monte-Carlo simulations.
arXiv comment23 pages, 14 figures, 5 tables
References in corpus (12)
- A fast Monte Carlo algorithm for site or bond percolation
- Efficient Monte Carlo algorithm and high-precision results for percolation
- Convergence of threshold estimates for two-dimensional percolation
- The ground state energy at unitarity
- Percolation Thresholds and Fisher Exponents in Hypercubic Lattices
- Complementary algorithms for graphs and percolation
- Transfer matrix computation of critical polynomials for two-dimensional Potts models
- Bond percolation thresholds on Archimedean lattices from critical polynomial roots
- Percolation in Finite Matching Lattices
- Series Expansion of the Percolation Threshold on Hypercubic Lattices
- Percolation is Odd
- Lattice paths inside a table, I