We consider the standard site percolation model on the $d$-dimensional lattice. A direct consequence of the proof of the uniqueness of the infinite cluster of Aizenman, Kesten and Newman [Comm. Math. Phys. 111 (1987) 505-531] is that the two-arms exponent is larger than or equal to $1/2$. We improve slightly this lower bound in any dimension $d\geq2$. Next, starting only with the hypothesis that $θ(p)>0$, without using the slab technology, we derive a quantitative estimate establishing long-range order in a finite box.
Consider critical site percolation on $\mathbb{Z}^d$ with $d \geq 2$. Cerf (2015) pointed out that from classical work by Aizenman, Kesten and Newman (1987) and Gandolfi, Grimmett and Russo (1988) one can obtain that the two-arms exponent is at least $1/2$. The paper by Cerf slightly improves that lower bound. Except for $d=2$ and for high $d$, no upper bound for this exponent seems to be known in the literature so far (not even implicity). We show that the distance-$n$ two-arms probability is at least $c n^{-(d^2 + 4 d -2)}$ (with $c >0$ a constant which depends on $d$), thus giving an upper …
Consider critical percolation in two dimensions. Under the condition that there are k disjoint alternating black and white arms crossing the annulus A(l,n), we prove a central limit theorem and variance estimates for the winding angles of the arms (as n\rightarrow \infty, l fixed). This result confirms a prediction of Beffara and Nolin (Ann. Probab. 39: 1286--1304, 2011). Using this theorem, we also get a CLT for the multiple-armed incipient infinite cluster (IIC) measures.
Kesten showed the exponential decay of percolation probability in the subcritical phase for the two-dimensional percolation model. This result implies his celebrated computation that $p_c=0.5$ for bond percolation in the square lattice, and site percolation in the triangular lattice, respectively. In this paper, we present a simpler proof for Kesten's theorem.
This paper is studying the critical regime of the planar random-cluster model on $\mathbb Z^2$ with cluster-weight $q\in[1,4)$. More precisely, we prove crossing estimates in quads which are uniform in their boundary conditions and depend only on their extremal lengths. They imply in particular that any fractal boundary is touched by macroscopic clusters, uniformly in its roughness or the configuration on said boundary. Additionally, they imply that any sub-sequential scaling limit of the collection of interfaces between primal and dual clusters is made of loops that are non-simple. We also ob…
In this note, we study the model of directed last passage percolation on $\mathbb{Z}^2$, with i.i.d. exponential weight. We consider the maximum paths from vertices $\left(0,\lfloor k^{2/3} \rfloor\right)$ and $(\lfloor k^{2/3} \rfloor,0)$ to $(n,n)$, respectively. For the coalescing point of these paths, we show that the probability for it being $>kR$ far away from the origin is in the order of $R^{-2/3}$. This is motivated by a recent work of Basu, Sarkar, and Sly, where the same estimate was obtained for semi-infinite geodesics, and the optimal exponent for the finite case was left open. Ou…
We investigate the so-called monochromatic arm exponents for critical percolation in two dimensions. These exponents, describing the probability of observing j disjoint macroscopic paths, are shown to exist and to form a different family from the (now well understood) polychromatic exponents. More specifically, our main result is that the monochromatic j-arm exponent is strictly between the polychromatic j-arm and (j+1)-arm exponents.
We study gradient percolation for site percolation on the triangular lattice. This is a percolation model where the percolation probability depends linearly on the location of the site. We prove the results predicted by physicists for this model. More precisely, we describe the fluctuations of the interfaces around their (straight) scaling limits, and the expected and typical lengths of these interfaces. These results build on the recent results for critical percolation on this lattice by Smirnov, Lawler, Schramm and Werner, and on the scaling ideas developed by Kesten.
For two-dimensional percolation at criticality, we discuss the inequality $α_4 > 1$ for the polychromatic four-arm exponent (and stronger versions, the strongest so far being $α_4 \geq 1 + \frac{α_2}{2}$, where $α_2$ denotes the two-arm exponent). We first briefly discuss five proofs (some of them implicit and not self-contained) from the literature. Then we observe that, by combining two of them, one gets a completely self-contained (and yet quite short) proof.
We consider the first-passage percolation problem on effectively one-dimensional graphs with vertex set {1,...,n}\times{0,1} and translation-invariant edge-structure. For three of six non-trivial cases we obtain exact expressions for the asymptotic percolation rate χ by solving certain recursive distributional equations and invoking results from ergodic theory to identify χ as the expected asymptotic one-step growth of the first-passage time from (0,0) to (n,0).
We consider first-passage percolation on a ladder, i.e. the graph {0,1,...}*{0,1} where nodes at distance 1 are joined by an edge, and the times are exponentially i.i.d. with mean 1. We find an appropriate Markov chain to calculate an explicit expression for the time constant whose numerical value is approximately 0.6827. This time constant is the long-term average inverse speed of the process. We also calculate the average residual time.
We provide the first nontrivial upper bound for the chemical distance exponent in two-dimensional critical percolation. Specifically, we prove that the expected length of the shortest horizontal crossing path of a box of side length $n$ in critical percolation on $\mathbb{Z}^2$ is bounded by $Cn^{2-δ}π_3(n)$, for some $δ>0$, where $π_3(n)$ is the "three-arm probability to distance $n$." This implies that the ratio of this length to the length of the lowest crossing is bounded by an inverse power of $n$ with high probability. In the case of site percolation on the triangular lattice, we obtain …
We consider 2d critical Bernoulli percolation on the square lattice. We prove an approximate color-switching lemma comparing k-arm probabilities for different polychromatic color sequences. This result is well-known for site percolation on the triangular lattice in [Nolin08]. To handle the complications arising from the dual lattice, we introduce a shifting transformation to convert arms between the primal and dual lattices.
Let $\{η_{N, v}: v\in V_N\}$ be a discrete Gaussian free field in a two-dimensional box $V_N$ of side length $N$ with Dirichlet boundary conditions. We study the Liouville first passage percolation, i.e., the shortest path metric where each vertex is given a weight of $e^{γη_{N, v}}$ for some $γ>0$. We show that for sufficiently small but fixed $γ>0$, the expected Liouville FPP distance between any pair of vertices is $O(N^{1-γ^2/10^3})$.
We consider planar stationary exponential Last Passage Percolation in the positive quadrant with boundary weights. For $ρ\in (0,1)$ and points $v_N=((1-ρ)^2 N,ρ^2 N)$ going to infinity along the characteristic direction, we establish right tail estimates with the optimal exponent for the exit time of the geodesic, along with optimal exponent estimates for the upper tail moderate deviations for the passage time. For the case $ρ=\frac{1}{2}$ in the stationary model, we establish the lower bound estimate with the optimal exponent for the lower tail of the passage time. Our arguments are based on …
In a recent breakthrough work, Chatterjee [Ann. of Math. (2) 177 (2013) 663-697] proved a long standing conjecture that relates the transversal exponent $ξ$ and the fluctuation exponent $χ$ in first-passage percolation on $\mathbb{Z}^d$. The purpose of this paper is to replace the main argument of Chatterjee (2013) and give an alternative proof of this relation. Specifically, we show that under the assumption that exponents defined in Chatterjee (2013) exist, one has the relation $χ\leq2ξ-1$. One advantage of our argument is that it does not require the "nearly Gamma" assumption of Chatterjee …
Let $\{η(v): v\in V_N\}$ be a discrete Gaussian free field in a two-dimensional box $V_N$ of side length $N$ with Dirichlet boundary conditions. We study the Liouville first passage percolation, i.e., the shortest path metric where each vertex is given a weight of $e^{γη(v)}$ for some $γ>0$. We show that for sufficiently small but fixed $γ>0$, with probability tending to $1$ as $N\to \infty$, all geodesics between vertices of macroscopic Euclidean distances simultaneously have (the conjecturally unique) length exponent strictly larger than 1.
We study the alternating $k$-arm incipient infinite cluster (IIC) of site percolation on the triangular lattice $\mathbb{T}$. Using Camia and Newman's result that the scaling limit of critical site percolation on $\mathbb{T}$ is CLE$_6$, we prove the existence of the scaling limit of the $k$-arm IIC for $k=1,2,4$. Conditioned on the event that there are open and closed arms connecting the origin to $\partial \mathbb{D}_R$, we show that the winding number variance of the arms is $(3/2+o(1))\log R$ as $R\rightarrow \infty$, which confirms a prediction of Wieland and Wilson (2003). Our proof uses…
We consider the branching random walk $\{\mathcal R^N_z: z\in V_N\}$ with Gaussian increments indexed over a two-dimensional box $V_N$ of side length $N$, and we study the first passage percolation where each vertex is assigned weight $e^{γ\mathcal R^N_z}$ for $γ>0$. We show that for $γ>0$ sufficiently small but fixed, the expected FPP distance between the left and right boundaries is at most $O(N^{1 - γ^2/10})$.
We study moderate deviations in the exponential corner growth model, both in the bulk setting and the increment-stationary setting. The main results are sharp right-tail bounds on the last-passage time and the exit point of the increment-stationary process. The arguments utilize calculations with the stationary version and a moment generating function identity due to E. Rains, for which we give a short probabilistic proof. As applications of the deviation bounds, we derive upper bounds on the speed of distributional convergence in the Busemann function and competition interface limits.
We study the probability that the origin is connected to the sphere of radius r (an arm event) in critical percolation in high dimensions, namely when the dimension d is large enough or when d>6 and the lattice is sufficiently spread out. We prove that this probability decays like 1/r^2. Furthermore, we show that the probability of having k disjoint arms to distance r emanating from the vicinity of the origin is 1/r^2k.
We derive an estimate for the distance, measured in lattice spacings, inside two-dimensional critical percolation clusters from the origin to the boundary of the box of side length $2n$, conditioned on the existence of an open connection. The estimate we obtain is the radial analogue of the one found in the work of Damron, Hanson, and Sosoe. In the present case, however, there is no lowest crossing in the box to compare to, so we construct a path $γ$ from the origin to distance $n$ that consists of "three-arm" points, and whose volume can thus be estimated by $O(n^2π_3(n))$. Here, $π_3(n)$ is …
In this paper we consider the first passage percolation with identical and independent exponentially distributions, called the Eden growth model, and we study the upper tail large deviations for the first passage time ${\rm T}$. Our main results prove that for any $ξ>0$ and $x\neq 0$, $\mathbb{P}({\rm T}(0,nx)>n(μ+ξ))$ decays as $\exp{(-(2dξ+o(1))n)}$ with a time constant $μ$ and a dimension $d$. Moreover, we extend the result to stretched exponential distributions. On the contrary, we construct a continuous distribution with a finite exponential moment where the rate function does not exist.
We consider first passage percolation (FPP) where the vertex weight is given by the exponential of two-dimensional log-correlated Gaussian fields. Our work is motivated by understanding the discrete analog for the random metric associated with \emph{Liouville quantum gravity} (LQG), which roughly corresponds to the exponential of a two-dimensional Gaussian free field (GFF). The particular focus of the present paper is an aspect of universality for such FPP among the family of log-correlated Gaussian fields. More precisely, we construct a family of log-correlated Gaussian fields, and show that …
We prove that critical percolation on any quasi-transitive graph of exponential volume growth does not have a unique infinite cluster. This allows us to deduce from earlier results that critical percolation on any graph in this class does not have any infinite clusters. The result is new when the graph in question is either amenable or nonunimodular.
We show how to combine Kesten's scaling relations, the determination of critical exponents associated to the stochastic Loewner evolution process by Lawler, Schramm, and Werner, and Smirnov's proof of Cardy's formula, in order to determine the existence and value of critical exponents associated to percolation on the triangular lattice.
It has been conjectured in numerous physics papers that in ordinary first-passage percolation on integer lattices, the fluctuation exponent $χ$ and the wandering exponent $ξ$ are related through the universal relation $χ=2ξ-1$, irrespective of the dimension. This is sometimes called the KPZ relation between the two exponents. This article gives a rigorous proof of this conjecture assuming that the exponents exist in a certain sense.
We study first passage percolation on the plane for a family of invariant, ergodic measures on $\mathbb{Z}^2$. We prove that for all of these models the asymptotic shape is the $\ell$-$1$ ball and that there are exactly four infinite geodesics starting at the origin a.s. In addition we determine the exponents for the variance and wandering of finite geodesics. We show that the variance and wandering exponents do not satisfy the relationship of $χ=2ξ-1$ which is expected for independent first passage percolation.
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 $β= 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 fo…
The probability that the cluster of the origin in critical site percolation on the triangular grid has diameter larger than $R$ is proved to decay like $R^{-5/48}$ as $R\to\infty$.
Consider a long-range percolation model on $\mathbb{Z}^d$ where the probability that an edge $\{x,y\} \in \mathbb{Z}^d \times \mathbb{Z}^d$ is open is proportional to $\|x-y\|_2^{-d-α}$ for some $α>0$ and where $d > 3 \min\{2,α\}$. We prove that in this case the one-arm exponent equals $ \min\{4,α\}/2$. We also prove that the maximal displacement for critical branching random walk scales with the same exponent. This establishes that both models undergo a phase transition in the parameter $α$ when $α=4$.
We examine the percolation model in $\mathbb{Z}^d$ by an approach involving lattice animals, in which their relevant characteristic is surface-area-to-volume ratio. Two critical exponents are introduced. The first is related to the growth rate in size of the number of lattice animals up to translation whose surface-area-to-volume ratio is marginally greater than $1/p_c -1$. The second describes how unusually large clusters form in the percolation model at parameter values slightly below $p_c$. Certain inequalities on the pair of exponents cannot be satisfied, while others imply the continuity …
In the mean field (or random link) model there are $n$ points and inter-point distances are independent random variables. For $0 < \ell < \infty$ and in the $n \to \infty$ limit, let $δ(\ell) = 1/n \times$ (maximum number of steps in a path whose average step-length is $\leq \ell$). The function $δ(\ell)$ is analogous to the percolation function in percolation theory: there is a critical value $\ell_* = e^{-1}$ at which $δ(\cdot)$ becomes non-zero, and (presumably) a scaling exponent $β$ in the sense $δ(\ell) \asymp (\ell - \ell_*)^β$. Recently developed probabilistic methodology (in some sens…
We prove upper bounds on the one-arm exponent $η_1$ for a class of dependent percolation models which generalise Bernoulli percolation; while our main interest is level set percolation of Gaussian fields, the arguments apply to other models in the Bernoulli percolation universality class, including Poisson-Voronoi and Poisson-Boolean percolation. More precisely, in dimension $d=2$ we prove that $η_1 \le 1/3$ for continuous Gaussian fields with rapid correlation decay (e.g. the Bargmann-Fock field), and in $d \ge 3$ we prove $η_1 \le d/3$ for finite-range fields, both discrete and continuous, a…
All (in)homogeneous bond percolation models on the square, triangular, and hexagonal lattices belong to the same universality class, in the sense that they have identical critical exponents at the critical point (assuming the exponents exist). This is proved using the star-triangle transformation and the box-crossing property. The exponents in question are the one-arm exponent $ρ$, the 2j-alternating-arms exponents $ρ_{2j}$ for $j\ge1$, the volume exponent $δ$, and the connectivity exponent $η$. By earlier results of Kesten, this implies universality also for the near-critical exponents $β$, $…
We apply a variation on the methods of Duminil-Copin, Raoufi, and Tassion to establish a new differential inequality applying to both Bernoulli percolation and the Fortuin-Kasteleyn random cluster model. This differential inequality has a similar form to that derived for Bernoulli percolation by Menshikov but with the important difference that it describes the distribution of the volume of a cluster rather than of its radius. We apply this differential inequality to prove the following: The critical exponent inequalities $γ\leq δ-1$ and $Δ\leq γ+1$ hold for percolation and the random cluster m…
Consider a cellular automaton with state space $\{0,1 \}^{{\mathbb Z}^2}$ where the initial configuration $ω_0$ is chosen according to a Bernoulli product measure, 1's are stable, and 0's become 1's if they are surrounded by at least three neighboring 1's. In this paper we show that the configuration $ω_n$ at time n converges exponentially fast to a final configuration $\barω$, and that the limiting measure corresponding to $\barω$ is in the universality class of Bernoulli (independent) percolation. More precisely, assuming the existence of the critical exponents $β$, $η$, $ν$ and $γ$, and of …
We study the percolation model on Boltzmann triangulations using a generating function approach. More precisely, we consider a Boltzmann model on the set of finite planar triangulations, together with a percolation configuration (either site-percolation or bond-percolation) on this triangulation. By enumerating triangulations with boundaries according to both the boundary length and the number of vertices/edges on the boundary, we are able to identify a phase transition for the geometry of the origin cluster. For instance, we show that the probability that a percolation interface has length n …
Discrete and continuum Liouville first passage percolation (DLFPP, LFPP) are two approximations of the conjectural $γ$-Liouville quantum gravity (LQG) metric, obtained by exponentiating the discrete Gaussian free field (GFF) and the circle average regularization of the continuum GFF respectively. We show that these two models can be coupled so that with high probability distances in these models agree up to $o(1)$ errors in the exponent, and thus have the same distance exponent. Ding and Gwynne (2018) give a formula for the continuum LFPP distance exponent in terms of the $γ$-LQG dimension exp…
The bulk one-arm exponent for the CLE$_{κ'}$ percolations
Peking University（北京大学）；Beijing International Center for Mathematical Research, Peking University（北京大学北京国际数学研究中心）；Courant Institute of Mathematical Sciences, New York University（纽约大学柯朗数学科学研究所）；University of Pennsylvania（宾夕法尼亚大学）
Discrete Liouville first passage percolation (LFPP) with parameter $ξ> 0$ is the random metric on a sub-graph of $\mathbb Z^2$ obtained by assigning each vertex $z$ a weight of $e^{ξh(z)}$, where $h$ is the discrete Gaussian free field. We show that the distance exponent for discrete LFPP is strictly positive for all $ξ> 0$. More precisely, the discrete LFPP distance between the inner and outer boundaries of a discrete annulus of size $2^n$ is typically at least $2^{αn}$ for an exponent $α> 0$ depending on $ξ$. This is a crucial input in the proof that LFPP admits non-trivial subsequential sca…
2D Percolation path exponents $x^{\cal P}_{\ell}$ describe probabilities for traversals of annuli by $\ell$ non-overlapping paths, each on either occupied or vacant clusters, with at least one of each type. We relate the probabilities rigorously to amplitudes of $O(N=1)$ models whose exponents, believed to be exact, yield $x^{\cal P}_{\ell}=({\ell}^2-1)/12$. This extends to half-integers the Saleur--Duplantier exponents for $k=\ell/2$ clusters, yields the exact fractal dimension of the external cluster perimeter, $D_{EP}=2-x^{\cal P}_3=4/3$, and also explains the absence of narrow gate fjords,…
We consider the bond percolation problem on a transient weighted graph induced by the excursion sets of the Gaussian free field on the corresponding cable system. Owing to the continuity of this setup and the strong Markov property of the field on the one hand, and the links with potential theory for the associated diffusion on the other, we rigorously determine the behavior of various key quantities related to the (near-)critical regime for this model. In particular, our results apply in case the base graph is the three-dimensional cubic lattice. They unveil the values of the associated criti…
For directed last passage percolation on $\mathbb{Z}^2$ with exponential passage times on the vertices, let $T_{n}$ denote the last passage time from $(0,0)$ to $(n,n)$. We consider asymptotic two point correlation functions of the sequence $T_{n}$. In particular we consider ${\rm Corr}(T_{n}, T_{r})$ for $r\le n$ where $r,n\to \infty$ with $r\ll n$ or $n-r \ll n$. We show that in the former case ${\rm Corr}(T_{n}, T_{r})=Θ((\frac{r}{n})^{1/3})$ whereas in the latter case $1-{\rm Corr}(T_{n}, T_{r})=Θ((\frac{n-r}{n})^{2/3})$. The argument revolves around finer understanding of polymer geometry…
In high dimensional percolation at parameter $p < p_c$, the one-arm probability $π_p(n)$ is known to decay exponentially on scale $(p_c - p)^{-1/2}$. We show the same statement for the ratio $π_p(n) / π_{p_c}(n)$, establishing a form of a hypothesis of scaling theory. As part of our study, we provide sharp estimates (with matching upper and lower bounds) for several quantities of interest at the critical probability $p_c$. These include the tail behavior of volumes of, and chemical distances within, spanning clusters, along with the scaling of the two-point function at "mesoscopic distance" fr…
Let $G$ be a connected, locally finite, transitive graph, and consider Bernoulli bond percolation on $G$. We prove that if $G$ is nonamenable and $p > p_c(G)$ then there exists a positive constant $c_p$ such that \[\mathbf{P}_p(n \leq |K| < \infty) \leq e^{-c_p n}\] for every $n\geq 1$, where $K$ is the cluster of the origin. We deduce the following two corollaries: 1. Every infinite cluster in supercritical percolation on a transitive nonamenable graph has anchored expansion almost surely. This answers positively a question of Benjamini, Lyons, and Schramm (1997). 2. For transitive nonamenabl…
Bootstrap percolation is a wide class of monotone cellular automata with random initial state. In this work we develop tools for studying in full generality one of the three `universality' classes of bootstrap percolation models in two dimensions, termed subcritical. We introduce the new notion of `critical densities' serving the role of `difficulties' for critical models, but adapted to subcritical ones. We characterise the critical probability in terms of these quantities and successfully apply this link to prove new and old results for concrete models such as DTBP and Spiral as well as a ge…
