Series expansion of the percolation threshold on hypercubic lattices

Abstract

We study proper lattice animals for bond-and site-percolation on the hypercubic lattice Z d to derive asymptotic series of the percolation threshold p c in 1/d, The first few terms of these series were computed in the 1970s, but the series have not been extended since then. We add two more terms to the series for p site c and one more term to the series for p bond c , using a combination of brute-force enumeration, combinatorial identities and an approach based on Padé approximants, which requires much fewer resources than the classical method. We discuss why it took 40 years to compute these terms, and what it would take to compute the next ones. En passant, we present new perimeter polynomials for site and bond percolation and numerical values for the growth rate of bond animals.

Precise bond percolation thresholds on several four-dimensional lattices

“…By examining wrapping probabilities, Wang et al [16,17] simulated the bond and site percolation models on several threedimensional lattices, including simple cubic (SC), the diamond, body-centered cubic (BCC), and face-centered cubic (FCC) lattices. Other recent work on percolation includes [18][19][20][21][22][23][24][25][26][27].…”

Critical site percolation in high dimension

“…The first four terms are due to Gaunt, Ruskin and Sykes [10], the latter two were found recently by Mertens and Moore [19] by exploiting involved numerical methods.…”

Critical Site Percolation in High Dimension

“…(1.5) The first four terms are due to Gaunt, Ruskin and Sykes [9], the latter two were found recently by Mertens and Moore [21] by exploiting involved numerical methods.…”