Series Expansion of the Percolation Threshold on Hypercubic Lattices

TL;DR

This paper extends the asymptotic series for the percolation threshold on hypercubic lattices by adding new terms using efficient enumeration and approximation methods, providing deeper insights into percolation properties.

Contribution

It introduces additional terms to the series expansion of the percolation threshold using novel computational techniques, improving upon previous limited series data.

Findings

Extended series for p_c on hypercubic lattices with new terms

Developed efficient enumeration and approximation methods

Presented new perimeter polynomials and growth rate data

Abstract

We study proper lattice animals for bond- and site-percolation on the hypercubic lattice $\mathbb{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 $\pcsite$ and one more term to the series for $\pcbond$, using a combination of brute-force enumeration, combinatorial identities and an approach based on Pad\'e 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.