Percolation Thresholds in Hyperbolic Lattices
Stephan Mertens, Cristopher Moore

TL;DR
This paper accurately computes percolation thresholds in hyperbolic lattices using invasion percolation, explores their dependency on lattice parameters, and establishes bounds and critical exponents.
Contribution
It provides highly precise numerical values for percolation thresholds in hyperbolic tessellations and derives bounds and scaling relations based on lattice parameters.
Findings
Percolation thresholds are computed with six to seven decimal place accuracy.
Functional dependency of thresholds on P and Q is numerically explored.
Rigorous bounds for thresholds are established, aiding in understanding their scaling.
Abstract
We use invasion percolation to compute numerical values for bond and site percolation thresholds (existence of an infinite cluster) and (uniqueness of the infinite cluster) of tesselations of the hyperbolic plane, where faces meet at each vertex and each face is a -gon. Our values are accurate to six or seven decimal places, allowing us to explore their functional dependency on and and to numerically compute critical exponents. We also prove rigorous upper and lower bounds for and that can be used to find the scaling of both thresholds as a function of and .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
