Hostname: page-component-74656f9884-2dmjx Total loading time: 0 Render date: 2026-11-07T05:19:52.065Z Has data issue: false hasContentIssue false

Percolation probability and critical exponents for site percolation on the UIPT

Published online by Cambridge University Press:  20 October 2022

Laurent Ménard*
Affiliation:
New York University Shanghai, Shanghai, China and Laboratoire Modal’X, Université Paris Nanterre, Nanterre, France
Rights & Permissions [Opens in a new window]

Abstract

We derive three critical exponents for Bernoulli site percolation 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 $\beta = 1/2$. 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 n vertices decays like $n^{-1/7}$. 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 n decays like $n^{-4/3}$. Among these three exponents, only the last one was previously known. Our main tools are the so-called gasket decomposition of percolation clusters, generic properties of random Boltzmann maps, and analytic combinatorics.

Information

Type
Article
Copyright
© The Author(s), 2022. Published by Cambridge University Press on behalf of The Canadian Mathematical Society
Figure 0

Figure 1: Plot of the probability ${\mathbb P}_{\infty }^p (|{\mathfrak C}| = \infty )$ for $p\in [0,1]$.

Figure 1

Figure 2: Gasket decomposition: A face of the root cluster (black vertices in the figure) is filled with a triangulation with arbitrary white boundary (upper-right figure, gray vertices can be either black or white) and a necklace (lower-right figure) triangulating the region between the two.