Analytic results for the percolation transitions of the enhanced binary tree
Petter Minnhagen, Seung Ki Baek

TL;DR
This paper analytically determines the two percolation thresholds of the enhanced binary tree, providing exact values and a size-scaling exponent, and compares these results with simulations and related models to deepen understanding of percolation on curved structures.
Contribution
It presents the first analytic derivation of the two critical percolation thresholds for the enhanced binary tree, clarifying their exactness and physical implications.
Findings
Derived exact thresholds: p_{c1}=1/2√13 - 3/2 and p_{c2}=1/2.
Established the size-scaling exponent Φ.
Validated the analytic results with Monte Carlo simulations.
Abstract
Percolation for a planar lattice has a single percolation threshold, whereas percolation for a negatively curved lattice displays two separate thresholds. The enhanced binary tree (EBT) can be viewed as a prototype model displaying two separate percolation thresholds. We present an analytic result for the EBT model which gives two critical percolation threshold probabilities, and , and yields a size-scaling exponent . It is inferred that the two threshold values give exact upper limits and that is furthermore exact. In addition, we argue that is also exact. The physics of the model and the results are described within the midpoint-percolation concept: Monte Carlo simulations are presented for the number of boundary points which are reached from the midpoint, and the results are compared to…
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.
