Exact site-percolation probability on the square lattice
Keyword(s):
A Site
◽
Abstract We present an algorithm to compute the exact probability $R_{n}(p)$ for a site percolation cluster to span an $n\times n$ square lattice at occupancy $p$. The algorithm has time and space complexity $O(\lambda^n)$ with $\lambda \approx 2.6$. It allows us to compute $R_{n}(p)$ up to $n=24$. We use the data to compute estimates for the percolation threshold $p_c$ that are several orders of magnitude more precise than estimates based on Monte-Carlo simulations.
2000 ◽
Vol 11
(01)
◽
pp. 205-209
◽
1997 ◽
Vol 08
(03)
◽
pp. 473-481
◽
2000 ◽
Vol 11
(03)
◽
pp. 519-524
◽
Keyword(s):
2015 ◽
Vol 145
(3)
◽
pp. 481-512
◽
Keyword(s):
2011 ◽
Vol 134
(1)
◽
2016 ◽
Vol 27
(03)
◽
pp. 1650026
◽