In this paper, we consider Bernoulli percolation on a locally finite, transitive and infinite graph (e.g. the hypercubic lattice $\mathbb{Z}^d$). We prove the following estimate, where $θ_n(p)$ is the probability that there is a path of $p$-open edges from $0$ to the sphere of radius $n$: \[ \forall p\in [0,1],\forall m,n \ge 1, \quad θ_{2n} (p-2θ_m(p))\le C\frac{θ_n(p)}{2^{n/m}}. \] This result implies that $θ_n(p)$ decays exponentially fast in the subcritical phase. It also implies the mean-field lower bound in the supercritical phase. We thus provide a new proof of the sharpness of the phase transition for Bernoulli percolation. Contrary to the previous proofs of sharpness, we do not rely on any differential formula. The main novelty is a stochastic domination result which is inspired by [Russo, 1982]. We also discuss a consequence of our result for percolation in high dimensions, where it can be seen as a near-critical sharpness estimate.
We provide a new proof of the sharpness of the phase transition for nearest-neighbour Bernoulli percolation. More precisely, we show that - for $p<p_c$, the probability that the origin is connected by an open path to distance $n$ decays exponentially fast in $n$. - for $p>p_c$, the probability that the origin belongs to an infinite cluster satisfies the mean-field lower bound $θ(p)\ge\tfrac{p-p_c}{p(1-p_c)}$. This note presents the argument of \cite{DumTas15}, which is valid for long-range Bernoulli percolation (and for the Ising model) on arbitrary transitive graphs in the simpler framework o…
We prove that for Bernoulli percolation on a graph $\mathbb{Z}^2\times\{0,\dots,k\}$ ($k\ge 0$), there is no infinite cluster at criticality, almost surely. The proof extends to finite range Bernoulli percolation models on $\mathbb{Z}^2$ which are invariant under $π/2$-rotation and reflection.
Two vertices are said to be finitely connected if they belong to the same cluster and this cluster is finite. We derive sharp asymptotics for finite connection probabilities for supercritical Bernoulli bond percolation on Z^2.
We provide a new proof of the sharpness of the phase transition for Bernoulli percolation and the Ising model. The proof applies to infinite range models on arbitrary locally finite transitive infinite graphs. For Bernoulli percolation, we prove finiteness of the susceptibility in the subcritical regime $β<β_c$, and the mean-field lower bound $\mathbb{P}_β[0\longleftrightarrow\infty]\ge (β-β_c)/β$ for $β>β_c$. For finite-range models, we also prove that for any $β<β_c$, the probability of an open path from the origin to distance $n$ decays exponentially fast in $n$. For the Ising model, we pro…
We prove that in the critical Bernoulli percolation on two dimensional lattice slabs the probabilities of open left-right crossings of rectangles with any given aspect ratio are uniformly positive.
We show that adding epsilon-Bernoulli percolation to an everywhere percolating subgraph of Z^2 results in a graph which has large scale geometry similar to that of supercritical Bernoulli percolation, in various specific senses. We conjecture similar behavior in higher dimensions.
We prove Ornstein-Zernike behaviour in every direction for finite connection functions of bond percolation on $\mathbb{Z}^{d}$ for $d\geq3$ when $p,$ the probability of occupation of a bond, is sufficiently close to $1.$ Moreover, we prove that equi-decay surfaces are locally analytic, strictly convex, with positive Gaussian curvature.
We provide a new proof of the near-critical scaling relation $β=ξ_1ν$ for Bernoulli percolation on the square lattice already proved by Kesten in 1987. We rely on a novel approach that does not invoke Russo's formula, but rather relates differences in crossing probabilities at different scales. The argument is shorter and more robust than previous ones and is more likely to be adapted to other models. The same approach may be used to prove the other scaling relations appearing in Kesten's work.
We prove a local limit theorem for the probability of a site to be connected by disjoint paths to three points in subcritical Bernoulli percolation on $\mathbb{Z}^{d},\,d\geq2$ in the limit where their distances tend to infinity.
We study homogeneous, independent percolation on general quasi-transitive graphs. We prove that in the disorder regime where all clusters are finite almost surely, in fact the expectation of the cluster size is finite. This extends a well-known theorem by Menshikov and Aizenman & Barsky to all quasi-transitive graphs. Moreover we deduce that in this disorder regime the cluster size distribution decays exponentially, extending a result of Aizenman & Newman. Our results apply to both edge and site percolation, as well as long range (edge) percolation. The proof is based on a modification of the …
We prove that for Bernoulli percolation on $\mathbb{Z}^d$, $d\geq 2$, the percolation density is an analytic function of the parameter in the supercritical interval. For this we introduce some techniques that have further implications. In particular, we prove that the susceptibility is analytic in the subcritical interval for all transitive short- or long-range models, and that $p_c^{bond} <1/2$ for certain families of triangulations for which Benjamini \& Schramm conjectured that $p_c^{site} \leq 1/2$.
We consider boundary roughness for the ``droplet'' created when supercritical two-dimensional Bernoulli percolation is conditioned to have an open dual circuit surrounding the origin and enclosing an area at least $l^2$, for large $l$. The maximum local roughness is the maximum inward deviation of the droplet boundary from the boundary of its own convex hull; we show that for large $l$ this maximum is at least of order $l^{1/3}(\log l)^{-2/3}$. This complements the upper bound of order $l^{1/3}(\log l)^{2/3}$ known for the average local roughness. The exponent 1/3 on $l$ here is in keeping wit…
We consider Poisson Boolean percolation on $\mathbb R^d$ with power-law distribution on the radius with a finite $d$-moment for $d\ge 2$. We prove that subcritical sharpness occurs for all but a countable number of power-law distributions. This extends the results of Duminil-Copin--Raoufi--Tassion where subcritical sharpness is proved under the assumption that the radii distribution has a $5d-3$ finite moment. Our proofs techniques are different from their paper: we do not use randomized algorithm and rely on specific independence properties of Boolean percolation, inherited from the underlyin…
We study percolation properties of the upper invariant measure of the contact process on $\mathbb{Z}^d$. Our main result is a sharp percolation phase transition with exponentially small clusters throughout the subcritical regime and a mean-field lower bound for the infinite cluster density in the supercritical regime. This generalizes and simplifies an earlier result of Van den Berg [Ann. App. Prob., 2011], who proved a sharp percolation phase transition on $\mathbb{Z}^2$. Our proof relies on the OSSS inequality for Boolean functions and is inspired by a series of papers by Duminil-Copin, Raou…
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…
We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $β\geq 0$. Intuitively, larger $β$ means more randomness. In particular, at $β=0$ we start with loops of length 1 and as $β$ crosses a critical value $β_c$, infinite loops start to occur almost surely. Our random loop models admit a natural comparison to bond percolation with $p=1-e^{-β}$ on the same graph to obtain a lower bound on $β_c$. For those graphs of diverging vertex degree where $β_c$ and the critical parameter for percolation have been calculated explicitly,…
We prove that the heavy clusters are indistinguishable for Bernoulli percolation on quasi-transitive nonunimodular graphs. As an application, we show that the uniqueness threshold of any quasi-transitive graph is also the threshold for connectivity decay. This resolves a question of Lyons and Schramm (1999) in the Bernoulli percolation case and confirms a conjecture of Schonmann (2001). We also prove that every infinite cluster of Bernoulli percolation on a nonamenable quasi-transitive graph is transient almost surely.
We consider a multiscale Boolean percolation on $\mathbb R^d$ with radius distribution $μ$ on $[1,+\infty)$, $d\ge 2$. The model is defined by superposing the original Boolean percolation model with radius distribution $μ$ with a countable number of scaled independent copies. The $n$-th copy is a Boolean percolation with radius distribution $μ|_{[1,κ]}$ rescaled by $κ^{n}$. We prove that under some regularity assumption on $μ$, the subcritical phase of the multiscale model is sharp for $κ$ large enough. Moreover, we prove that the existence of an unbounded connected component depends only on t…
In this note we study the phase transition for percolation on quasi-transitive graphs with quasi-transitively inhomogeneous edge-retention probabilities. A quasi-transitive graph is an infinite graph with finitely many different "types" of edges and vertices. We prove that the transition is sharp almost everywhere, i.e., that in the subcritical regime the expected cluster size is finite, and that in the subcritical regime the probability of the one-arm event decays exponentially. Our proof extends the proof of sharpness of the phase transition for homogeneous percolation on vertex-transitive g…
In this paper, we consider Voronoi percolation in the hyperbolic space $\mathbb{H}^d$ ($d\ge 2$) and show that the phase transition is sharp. More precisely, we show that for Voronoi percolation with parameter $p$ generated by a homogeneous Poisson point process with intensity $λ$, there exists $p_c:=p_c(λ,d)$ such that the probability of a monochromatic path from the origin reaching a distance of $n$ decays exponentially fast in $n$. We also prove the mean-field lower bound $\mathbb{P}_{λ,p}(0\leftrightarrow \infty)\ge c(p-p_c)$ for $p>p_c$.
We consider Bernoulli hyper-edge percolation on $\mathbb{Z}^d$. This model is a generalization of Bernoulli bond percolation. An edge connects exactly two vertices and a hyper-edge connects more than two vertices. As in the classical Bernoulli bond percolation, we open hyper-edges independently in a homogeneous manner with certain probabilities parameterized by a parameter $u\in[0,1]$. We discuss conditions for non-trivial phase transitions when $u$ varies. We discuss the conditions for the uniqueness of the infinite cluster. Also, we provide conditions under which the Grimmett-Marstrand type …
We study versions of the contact process with three states, and with infections occurring at a rate depending on the overall infection density. Motivated by a model described in [17] for vegetation patterns in arid landscapes, we focus on percolation under invariant measures of such processes. We prove that the percolation transition is sharp (for one of our models this requires a reasonable assumption). This is shown to contradict a form of 'robust critical behaviour' with power law cluster size distribution for a range of parameter values, as suggested in [17].
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…
We study a dependent site percolation model on the $n$-dimensional Euclidean lattice where, instead of single sites, entire hyperplanes are removed independently at random. We extend the results about Bernoulli line percolation showing that the model undergoes a non-trivial phase transition and proving the existence of a transition from exponential to power-law decay within some regions of the subcritical phase.
The goal of this note is to announce certain results in orbit equivalence theory, especially concerning the approximation of p.m.p. standard equivalence relations by increasing sequence of sub-relations, with applications to the behavior of the Bernoulli percolation on graphs at the threshold pu. Résumé en Français. Approximations de relations d'équivalence standards et percolation de Bernoulli à p\_u.
We consider the Bernoulli Boolean discrete percolation model on the d-dimensional integer lattice. We study sufficient conditions on the distribution of the radii of balls placed at the points of a Bernoulli point process for the absence of percolation, provided that the intensity of the underlying point process is small enough. We also study a Harris graphical procedure to construct, forward in time, particle systems with interactions of infinite range under the assumption that the corresponding generator admits a Kalikow-type decomposition. We do so by using the subcriticality of the boolean…
We study a competition model on $\mathbb{Z}^d$ where the two infections are driven by supercritical Bernoulli percolations with distinct parameters $p$ and $q$. We prove that, for any $q$, there exist at most countably many values of $p<\min(q, \overrightarrow{p\_c})$ such that coexistence can occur.
For directed Bernoulli last passage percolation with i.i.d.~weights on vertices over a $n\times n$ grid and for $n$ large enough, the geodesics are shown to be concentrated in a cylinder, centered on the main diagonal and of width of order $n^{(2κ+2)/(2κ+3)}\sqrt{\ln n}$, where $1\leκ<\infty$ is the curvature power of the shape function at $(1,1)$. The methodology of proof is robust enough to also apply to directed Bernoulli first passage site percolation, and further to longest common subsequences in random words.
We consider Bernoulli percolation on a locally finite quasi-transitive unimodular graph and prove that two infinite clusters cannot have infinitely many pairs of vertices at distance 1 from one another or, in other words, that such graphs exhibit ``cluster repulsion.'' This partially answers a question of Häggström, Peres and Schonmann.
We consider the standard site percolation model on the three dimensional cubic lattice. Starting solely with the hypothesis that $θ(p)>0$, we prove that, for any $α>0$, there exists $κ>0$ such that, with probability larger than $1-1/n^α$, every pair of vertices inside the box $Λ(n)$ are joined by a path having at most $κ(\ln n)^2$ closed sites.
Benjamini and Kesten introduced in 1995 the problem of embedding infinite binary sequences into a Bernoulli percolation configuration, known as "percolation of words". We give a positive answer to their Open Problem 2: almost surely, all words are seen for site percolation on Z^3 with parameter p = 1/2. We also extend this result in various directions, proving the same result for any dimension d at least three and for any value p in the interval (p_c(Z^d), 1 - p_c(Z^d)), and for restrictions to slabs. Finally, we provide an explicit estimate on the probability to find all words starting from a…
For the d-dimensional model of a subcritical bond percolation (p<p_c) and a point \vec{a} in Z^d, we prove that a cluster conditioned on connecting points (0,...,0) and n\vec{a} if scaled by 1/(n|vec{a}|) along \vec{a} and by 1/sqrt{n} in the orthogonal direction converges asymptotically to Time x (d-1)-dimensional Brownian Bridge.
Consider Bernoulli bond percolation on a locally finite, connected graph $G$ and let $p_{\mathrm{cut}}$ be the threshold corresponding to a "first-moment method" lower bound. Kahn (\textit{Electron.\ Comm.\ Probab.\ Volume 8, 184-187.} (2003)) constructed a counter-example to Lyons' conjecture of $p_{\mathrm{cut}}=p_c$ and proposed a modification. Here we give a positive answer to Kahn's modified question. The key observation is that in Kahn's modification, the new expectation quantity also appears in the differential inequality of one-arm events. This links the question to a lemma of Duminil-…
One of the most well-known classical results for site percolation on the square lattice is the equation p_c + p_c^* = 1. In words, this equation means that for all values different from p_c of the parameter p the following holds: Either a.s. there is an infinite open cluster or a.s. there is an infinite closed `star' cluster. This result is closely related to the percolation transition being sharp: Below p_c the size of the open cluster of a given vertex is not only (a.s.) finite, but has a distrubtion with an exponential tail. The analog of this result has been proved by Higuchi in 1993 for t…
For ordinary (independent) percolation on a large class of lattices it is well known that below the critical percolation parameter $p_c$ the cluster size distribution has exponential decay and that power-law behavior of this distribution can only occur at $p_c$. This behavior is often called ``sharpness of the percolation transition.'' For theoretical reasons, as well as motivated by applied research, there is an increasing interest in percolation models with (weak) dependencies. For instance, biologists and agricultural researchers have used (stationary distributions of) certain two-dimension…
In this note we study some properties of infinite percolation clusters on non-amenable graphs. In particular, we study the percolative properties of the complement of infinite percolation clusters. An approach based on mass-transport is adapted to show that for a large class of non-amenable graphs, the graph obtained by removing each site contained in an infinite percolation cluster has critical percolation threshold which can be arbitrarily close to the critical threshold for the original graph, almost surely, as p approaches p_c. Closely related is the self-destructive percolation process, i…
In this paper, we establish moderate deviations for the chemical distance in Bernoulli percolation. The chemical distance between two points is the length of the shortest open path between these two points. Thus, we study the size of random fluctuations around the mean value, and also the asymptotic behavior of this mean value. The estimates we obtain improve our knowledge of the convergence to the asymptotic shape. Our proofs rely on concentration inequalities proved by Boucheron, Lugosi and Massart, and also on the approximation theory of subadditive functions initiated by Alexander.
We investigate the problem of embedding infinite binary sequences into Bernoulli site percolation on $\mathbb{Z}^d$ with parameter $p$, known also as percolation of words.\ In 1995, I.\ Benjamini and H.\ Kesten proved that, for $d \geq 10$ and $p=1/2$, all sequences can be embedded, almost surely. They conjectured that the same should hold for $d \geq 3$. In this paper we consider $d \geq 3$ and $p \in (p_c(d), 1-p_c(d))$, where $p_c(d)<1/2$ is the critical threshold for site percolation on $\mathbb{Z}^d$. We show that there exists an integer $M = M (p)$, such that, a.s., every binary sequence…
We explore the survival function for percolation on Galton-Watson trees. Letting $g(T,p)$ represent the probability a tree $T$ survives Bernoulli percolation with parameter $p$, we establish several results about the behavior of the random function $g(\mathbf{T} , \cdot)$, where $\mathbf{T}$ is drawn from the Galton-Watson distribution. These include almost sure smoothness in the supercritical region; an expression for the $k\text{th}$-order Taylor expansion of $g(\mathbf{T} , \cdot)$ at criticality in terms of limits of martingales defined from $\mathbf{T}$ (this requires a moment condition d…
We show quenched large deviations for the simple random walk on a certain class of percolations with long-range correlations. This class contains the supercritical Bernoulli percolations, the model considered by Drewitz, R'ath and Sapozhnikov and the random-cluster model up to the slab critical point. Our result is an extension of Kubota's result for the supercritical Bernoulli percolations. We also state a shape theorem for the chemical distance, which is an extension of Garet and Marchand's result for the supercritical Bernoulli percolations.
Consider an anisotropic independent bond percolation model on the $d$-dimensional hypercubic lattice, $d\geq 2$, with parameter $p$. We show that the two point connectivity function $P_{p}(\{(0,\dots,0)\leftrightarrow (n,0,\dots,0)\})$ is a monotone function in $n$ when the parameter $p$ is close enough to 0. Analogously, we show that truncated connectivity function $P_{p}(\{(0,\dots,0)\leftrightarrow (n,0,\dots,0), (0,\dots,0)\nleftrightarrow\infty\})$ is also a monotone function in $n$ when $p$ is close to 1.
