Percolation on Hypergraphs with Four-Edges
Ojan Khatib Damavandi, Robert M. Ziff

TL;DR
This paper investigates percolation on hypergraphs with four-edges, deriving explicit self-duality solutions, identifying critical points, and confirming results through Monte Carlo simulations, thus expanding the understanding of exact percolation thresholds.
Contribution
It provides explicit solutions for self-duality conditions on hypergraphs with four-edges using generators with independent probabilities, introducing new exact critical points and inhomogeneous percolation models.
Findings
Explicit self-duality solutions for four-edge hypergraphs.
Critical percolation thresholds identified and verified via simulations.
New inhomogeneous percolation system interpolating between known models.
Abstract
We study percolation on self-dual hypergraphs that contain hyperedges with four bounding vertices, or "four-edges", using three different generators, each containing bonds or sites with three distinct probabilities , , and connecting the four vertices. We find explicit values of these probabilities that satisfy the self-duality conditions discussed by Bollob\'as and Riordan. This demonstrates that explicit solutions of the self-duality conditions can be found using generators containing bonds and sites with independent probabilities. These solutions also provide new examples of lattices where exact percolation critical points are known. One of the generators exhibits three distinct criticality solutions (, , ). We carry out Monte-Carlo simulations of two of the generators on two different hypergraphs to confirm the critical values. For the case of the hypergraph 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.
