Let L_n denote the lowest crossing of the 2n \times 2n square box B(n) centered at the origin for critical site percolation on Z^2 or critical site percolation on the triangular lattice imbedded in Z^2, and denote by Q_n the set of pivotal sites along this crossing. On the event that a pivotal site exists, denote the minimum height that a pivotal site attains above the bottom of B(n) by M_n:= min{m:(x,-n+m)\in Q_n for some -n\le x\le n}. Else, define M_n = 2n. We prove that P(M_n < m) \asymp m/n, uniformly for 1\le m\le n. This relation extends Theorem 1 of van den Berg and Jarai (2003) who handle the corresponding distribution for the lowest crossing in a slightly different context. As a corollary we establish the asymptotic distribution of the minimum height of the set of cut points of a certain chordal SLE_6 in the unit square of C.
This text is based on a lecture for the Sheffield Probability Day; its main purpose is to survey some recent asymptotic results about Bernoulli bond percolation on certain large random trees with logarithmic height. We also provide a general criterion for the existence of giant percolation clusters in large trees, which answers a question raised by David Croydon.
We propose a new definition of the interface in the context of the Bernoulli percolation model. We construct a coupling between two percolation configurations, one which is a standard percolation configuration, and one which is a percolation configuration conditioned on a disconnection event. We define the interface as the random set of the edges where these two configurations differ. We prove that, inside a cubic box $Λ$, the interface between the top and the bottom of the box is typically localised within a distance of order $(\ln |Λ|)^2$ of the set of the pivotal edges. We prove also that, …
We prove that the interface of critical site percolation on the triangular lattice converges to SLE$_6$ in its natural parametrization, where the discrete interface is parametrized such that each edge is crossed in one unit of time, while the limiting curve is parametrized by the $7/4$-dimensional Minkowski content. We also prove that the scaling limit of counting measure on the pivotal points, which was proved to exist by Garban, Pete, and Schramm (2013), is the $3/4$-dimensional Minkowski content up to a deterministic multiplicative constant.
Let L_n denote the lowest crossing of a square 2n\times2n box for critical site percolation on the triangular lattice imbedded in Z^2. Denote also by F_n the pioneering sites extending below this crossing, and Q_n the pivotal sites on this crossing. Combining the recent results of Smirnov and Werner [Math. Res. Lett. 8 (2001) 729-744] on asymptotic probabilities of multiple arm paths in both the plane and half-plane, Kesten's [Comm. Math. Phys. 109 (1987) 109-156] method for showing that certain restricted multiple arm paths are probabilistically equivalent to unrestricted ones, and our own se…
This work is the first in a series of papers devoted to the construction and study of scaling limits of dynamical and near-critical planar percolation and related objects like invasion percolation and the Minimal Spanning Tree. We show here that the counting measure on the set of pivotal points of critical site percolation on the triangular grid, normalized appropriately, has a scaling limit, which is a function of the scaling limit of the percolation configuration. We also show that this limit measure is conformally covariant, with exponent 3/4. Similar results hold for the counting measure o…
We prove several facts concerning Lipschitz percolation, including the following. The critical probability p_L for the existence of an open Lipschitz surface in site percolation on Z^d with d\ge 2 satisfies the improved bound p_L \le 1-1/[8(d-1)]. Whenever p > p_L, the height of the lowest Lipschitz surface above the origin has an exponentially decaying tail. The lowest surface is dominated stochastically by the boundary of a union of certain independent, identically distributed random subsets of Z^d. As a consequence, for p sufficiently close to 1, the connected regions of Z^{d-1} above which…
We prove existence of the scaling limit of the invasion percolation cluster (IPC) on a regular tree. The limit is a random real tree with a single end. The contour and height functions of the limit are described as certain diffusive stochastic processes. This convergence allows us to recover and make precise certain asymptotic results for the IPC. In particular, we relate the limit of the rescaled level sets of the IPC to the local time of the scaled height function.
In Poisson percolation each edge becomes open after an independent exponentially distributed time with rate that decreases in the distance from the origin. As a sequel to our work on the square lattice, we describe the limiting shape of the component containing the origin in the oriented case. We show that the density of occupied sites at height $y$ in the cluster is close to the percolation probability in the corresponding homogeneous percolation process, and we study the fluctuations of the boundary.
We consider the model of random trees introduced by Devroye (1999), the so-called random split trees. The model encompasses many important randomized algorithms and data structures. We then perform supercritical Bernoulli bond-percolation on those trees and obtain a precise weak limit theorem for the sizes of the largest clusters. We also show that the approach developed in this work may be useful for studying percolation on other classes of trees with logarithmic height, for instance, we study also the case of $d$-regular trees.
To highlight certain similarities in combinatorial representations of several well known two-dimensional models of statistical mechanics, we introduce and study a new family of models which specializes to these cases after a proper tuning of the parameters. To be precise, our model consists of two independent standard Potts models, with possibly different numbers of spins and different coupling constants (the four parameters of the model), defined jointly on a graph embedded in a surface and its dual graph, and conditioned on the event that the primal and dual interfaces between spins of diffe…
We consider the Bernoulli bond percolation model in a box $Λ$ (not necessarily parallel to the directions of the lattice) in the regime where the percolation parameter is close to $1$. We condition the configuration on the event that two opposite faces of the box are disconnected. We couple this configuration with an unconstrained percolation configuration. The interface edges are the edges which differ in the two configurations. We prove that, typically, each interface edge is within a distance of order $\ln|Λ|$ of another interface edge or of a pivotal edge. We derive an estimate for the law…
We prove that near-critical percolation and dynamical percolation on the triangular lattice $η\mathbb{T}$ have a scaling limit as the mesh $η\to 0$, in the "quad-crossing" space $\mathcal{H}$ of percolation configurations introduced by Schramm and Smirnov. The proof essentially proceeds by "perturbing" the scaling limit of the critical model, using the pivotal measures studied in our earlier paper. Markovianity and conformal covariance of these new limiting objects are also established.
Equip the edges of the lattice $\mathbb{Z}^2$ with i.i.d. random capacities. We prove a law of large numbers for the maximal flow crossing a rectangle in $\mathbb{R}^2$ when the side lengths of the rectangle go to infinity. The value of the limit depends on the asymptotic behaviour of the ratio of the height of the cylinder over the length of its basis. This law of large numbers extends the law of large numbers obtained by Grimmett and Kesten (1984) for rectangles of particular orientation.
We prove annealed scaling relations for planar Voronoi percolation. To our knowledge, this is the first result of this kind for a continuum percolation model. We are mostly inspired by the proof of scaling relations for Bernoulli percolation by Kesten [Kes87]. Along the way, we show an annealed quasi-multiplicativity property by relying on the quenched box-crossing property proved by Ahlberg, Griffiths, Morris and Tassion [AGMT16]. Intermediate results also include the study of quenched and annealed notions of pivotal events and the extension of the quenched box-crossing property of [AGMT16] t…
In this paper we study a variation of the accessibility percolation model, this is also motivated by evolutionary biology and evolutionary computation. Consider a tree whose vertices are labeled with random numbers. We study the probability of having a monotone subsequence of a path from the root to a leaf, where any $k$ consecutive vertices in the path contain at least one vertex of the subsequence. An $n$-ary tree, with height $h$, is a tree whose vertices at distance at most $h-1$ to the root have $n$ children. For the case of $n$-ary trees, we prove that, as $h$ tends to infinity the proba…
We analyze the geometry of scaling limits of near-critical 2D percolation, i.e., for $p=p_c+λδ^{1/ν}$, with $ν=4/3$, as the lattice spacing $δ\to 0$. Our proposed framework extends previous analyses for $p=p_c$, based on $SLE_6$. It combines the continuum nonsimple loop process describing the full scaling limit at criticality with a Poissonian process for marking double (touching) points of that (critical) loop process. The double points are exactly the continuum limits of "macroscopically pivotal" lattice sites and the marked ones are those that actually change state as $λ$ varies. This struc…
We compare level-set percolation for Gaussian free fields (GFFs) defined on a rectangular subset of $δ\mathbb{Z}^2$ to level-set percolation for GFFs defined on the corresponding metric graph as the mesh size $δ$ goes to 0. In particular, we look at the probability that there is a path that crosses the rectangle in the horizontal direction on which the field is positive. We show this probability is strictly larger in the discrete graph. In the metric graph case, we show that for appropriate boundary conditions the probability that there exists a closed pivotal edge for the horizontal crossing …
Kesten's incipient infinite cluster for the three-dimensional, metric-graph Gaussian free field, from critical level-set percolation, and for the Villain model, from random cluster geometries and a Swendsen-Wang type algorithm
We consider a four-vertex model introduced by Bálint Tóth: a dependent bond percolation model on $\mathbb{Z}^2$ in which every edge is present with probability 1/2 and each vertex has exactly two incident edges, perpendicular to each other. We prove that all components are finite cycles almost surely, but the expected diameter of the cycle containing the origin is infinite. Moreover, we derive the following critical exponents: the tail probability $\mathbb{P}$(diameter of the cycle of the origin $>$$n$) $\approx$ $n^{-γ}$ and the expectation $\mathbb{E}$(length of a typical cycle with diameter…
We compute the one-point probability distribution for the stationary KPZ equation (i.e. initial data H(0,X)=B(X), for B(X) a two-sided standard Brownian motion) and show that as time T goes to infinity, the fluctuations of the height function H(T,X) grow like T^{1/3} and converge to those previously encountered in the study of the stationary totally asymmetric simple exclusion process, polynuclear growth model and last passage percolation. The starting point for this work is our derivation of a Fredholm determinant formula for Macdonald processes which degenerates to a corresponding formula fo…
We consider TASEP with two types of particles starting at every second site. Particles to the left of the origin have jump rate $1$, while particles to the right have jump rate $α$. When $α<1$ there is a formation of a shock where the density jumps to $(1-α)/2$. For $α<1$ fixed, the statistics of the associated height functions around the shock is asymptotically (as time $t\to\infty$) a maximum of two independent random variables as shown in\cite{FN14}. In this paper we consider the critical scaling when $1-α=a t^{-1/3}$, where $t\gg 1$ is the observation time. In that case the decoupling does…
We study the solution of the Kardar-Parisi-Zhang (KPZ) equation for the stochastic growth of an interface of height $h(x,t)$ on the positive half line, equivalently the free energy of the continuum directed polymer in a half space with a wall at $x=0$. The boundary condition $\partial_x h(x,t)|_{x=0}=A$ corresponds to an attractive wall for $A<0$, and leads to the binding of the polymer to the wall below the critical value $A=-1/2$. Here we choose the initial condition $h(x,0)$ to be a Brownian motion in $x>0$ with drift $-(B+1/2)$. When $A+B \to -1$, the solution is stationary, i.e. $h(\cdot,…
