Percolation probability and critical exponents for site percolation on the UIPT
Laurent M\'enard

TL;DR
This paper derives critical exponents for Bernoulli site percolation on the UIPT, providing explicit formulas and decay rates for cluster size and perimeter probabilities at criticality.
Contribution
It introduces new explicit formulas for critical exponents and cluster laws in site percolation on the UIPT, extending previous knowledge.
Findings
Probability of an infinite root cluster computed explicitly.
Off-critical exponent for site percolation is 1/2.
At criticality, cluster size decays as n^{-1/7} and perimeter as n^{-4/3}.
Abstract
We derive three critical exponents for Bernoulli site percolation on the on the Uniform Infinite Planar Triangulation (UIPT). First we compute explicitly the probability that the root cluster is infinite. As a consequence, we show that the off-critical exponent for site percolation on the UIPT is . Then we establish an integral formula for the generating function of the number of vertices in the root cluster. We use this formula to prove that, at criticality, the probability that the root cluster has at least vertices decays like . Finally, we also derive an expression for the law of the perimeter of the root cluster and use it to establish that, at criticality, the probability that the perimeter of the root cluster is equal to decays like . Among these three exponents, only the last one was previously known. Our main tools are the so-called…
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.
Taxonomy
TopicsStochastic processes and statistical mechanics · Random Matrices and Applications · Theoretical and Computational Physics
