Critical percolation on the kagome hypergraph
Christian R. Scullard, Jesper Lykke Jacobsen, Robert M. Ziff

TL;DR
This paper investigates the critical percolation surface of the kagome hypergraph, using critical polynomials to accurately estimate percolation thresholds for various related lattices, revealing insights into the method's precision.
Contribution
It introduces a high-precision method for analyzing the critical surface of the kagome hypergraph, including special cases and an exact point, enhancing understanding of percolation thresholds.
Findings
Critical points computed to 17-18 digit precision.
Method provides accurate estimations comparable to Monte Carlo.
Analysis explains why the method is highly accurate for certain lattices.
Abstract
We study the percolation critical surface of the kagome lattice in which each triangle is allowed an arbitrary connectivity. Using the method of critical polynomials, we find points along this critical surface to high precision. This kagome hypergraph contains many unsolved problems as special cases, including bond percolation on the kagome and lattices, and site percolation on the hexagonal, or honeycomb, lattice, as well as a single point for which there is an exact solution. We are able to compute enough points along the critical surface to find a very accurate fit, essentially a Taylor series about the exact point, that allows estimations of the critical point of any system that lies on the surface to precision rivaling Monte Carlo and traditional techniques of similar accuracy. We find also that this system sheds light on some of the surprising aspects of the method of…
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.
