ResearchReplication
Measuring a Universal Constant on a Laptop: The Site Percolation Threshold
Fill the cells of a square grid at random. Each cell is occupied with probability , independently. Below a certain density the cells form scattered islands. Above it, one cluster reaches from top edge to bottom. That density, on an infinite grid, is the site percolation threshold. The square lattice has no closed form for it, so the constant has to be measured. We measured it. Our experiment is a computation, and nothing was observed in the physical world: a club program ran 114,520 Newman-Ziff union-find sweeps on lattices from to , in 526.5 seconds of wall clock, seeded from 20251215. Extrapolate the half-crossing point to infinite size with the exact two-dimensional exponent , and the intercept comes out at , the error bar bootstrapped from the sweeps themselves. The accepted value is 0.59274605. We sit +0.0000710 above it. Call that +0.64 of our own error bars. The disagreement first appears in the fifth decimal place, and three checks stand behind the number. The union-find matched a separate flood fill on 11,400 random configurations, with zero mismatches, and the pipeline reproduced the exact crossing polynomial of the 3×3 and 4×4 lattices to within 0.5 standard errors at every point tested. And the crossing probability at the accepted threshold settled onto a size-independent 1/2, as conformal field theory says it must, moving from 6.60 standard errors high at to 0.08 at . The fractal dimension of the largest cluster came out at 1.8823 against the exact 91/48 = 1.8958, a shortfall we keep and explain rather than fit away. Including our smallest lattice moves the answer to 0.5930250, 2.92 error bars out, and that single modelling choice is the largest one in the study.
Winter 2025Read 25 minSections 12
- LaTeX source42 kB
- Analysis code39 kB
- Raw output23 kB
- Interactive model