English
Related papers

Related papers: A new proof of the sharpness of the phase transiti…

200 papers

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 $\theta_n(p)$ is the probability that there is a path…

Probability · Mathematics 2023-04-25 Hugo Vanneuville

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…

Probability · Mathematics 2018-01-23 Hugo Duminil-Copin , Vincent Tassion

We consider Bernoulli percolation on transitive graphs of polynomial growth. In the subcritical regime ($p<p_c$), it is well known that the connection probabilities decay exponentially fast. In the present paper, we study the supercritical…

Probability · Mathematics 2023-05-17 Daniel Contreras , Sébastien Martineau , Vincent Tassion

We prove that the Poisson-Boolean percolation on $\mathbb{R}^d$ undergoes a sharp phase transition in any dimension under the assumption that the radius distribution has a $5d-3$ finite moment (in particular we do not assume that the…

Probability · Mathematics 2018-11-06 Hugo Duminil-Copin , Aran Raoufi , Vincent Tassion

We show that for all p>p_c(\Z^d) percolation parameters, the probability that the cluster of the origin is finite but has at least t vertices at distance one from the infinite cluster is exponentially small in t. We use this to give a short…

Probability · Mathematics 2016-08-15 Gabor Pete

In this paper, we prove that Bernoulli percolation on bounded degree graphs with isoperimetric dimension $d>4$ undergoes a non-trivial phase transition (in the sense that $p_c<1$). As a corollary, we obtain that the critical point of…

Probability · Mathematics 2020-12-23 Hugo Duminil-Copin , Subhajit Goswami , Aran Raoufi , Franco Severo , Ariel Yadin

We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…

Probability · Mathematics 2025-12-29 Alejandro Caicedo , Leonid Kolesnikov

We prove that for supercritical percolation on every infinite transitive graph, the probability that the origin belongs to a finite cluster of size at least $n$ decays exponentially in $\Phi(n)$, where $\Phi$ is the isoperimetric function…

We study the cluster-size distribution of supercritical long-range percolation on $\mathbb{Z}^d$, where two vertices $x,y\in\mathbb{Z}^d$ are connected by an edge with probability $\mathrm{p}(\|x-y\|):=p\min(1,\beta\|x-y\|)^{-d\alpha}$ for…

Probability · Mathematics 2024-07-23 Joost Jorritsma , Júlia Komjáthy , Dieter Mitsche

We prove that for Voronoi percolation on $\mathbb{R}^d$, there exists $p_c\in[0,1]$ such that - for $p<p_c$, there exists $c_p>0$ such that $\mathbb{P}_p[0\text{ connected to distance }n]\leq \exp(-c_p n)$, - there exists $c>0$ such that…

Probability · Mathematics 2017-05-24 Hugo Duminil-Copin , Aran Raoufi , Vincent Tassion

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…

Probability · Mathematics 2021-11-16 Xinyi Li , Yu Liu

We prove the sharpness of the phase transition for speed in the biased random walk on the supercritical percolation cluster on Z^d. That is, for each d at least 2, and for any supercritical parameter p > p_c, we prove the existence of a…

Probability · Mathematics 2013-10-18 Alexander Fribergh , Alan Hammond

For Bernoulli site percolation on an infinite, connected, locally finite graph $G=(V,E)$, we obtain quantitative upper bounds on the supercritical disconnection probability \[ \mathbb{P}_p(S\nleftrightarrow\infty) \] for arbitrary finite or…

Probability · Mathematics 2026-03-18 Zhongyang Li

We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…

Probability · Mathematics 2012-02-08 Hubert Lacoin

We prove that the supercritical phase of Voronoi percolation on $\mathbb{R}^d$, $d\geq 3$, is well behaved in the sense that for every $p>p_c(d)$ local uniqueness of macroscopic clusters happens with high probability. As a consequence,…

Probability · Mathematics 2024-10-25 Barbara Dembin , Franco Severo

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…

Probability · Mathematics 2020-08-05 Thomas Beekenkamp

We prove that if $(G_n)_{n\geq1}=((V_n,E_n))_{n\geq 1}$ is a sequence of finite, vertex-transitive graphs with bounded degrees and $|V_n|\to\infty$ that is at least $(1+\epsilon)$-dimensional for some $\epsilon>0$ in the sense that…

Probability · Mathematics 2024-01-17 Tom Hutchcroft , Matthew Tointon

Let us consider subcritical Bernoulli percolation on a connected, transitive, infinite and locally finite graph. In this paper, we propose a new (and short) proof of the exponential decay property for the volume of clusters. We do not rely…

Probability · Mathematics 2024-10-08 Hugo Vanneuville

We consider an i.i.d. supercritical bond percolation on Z^d , every edge is open with a probability p > p\_c (d), where p\_c (d) denotes the critical parameter for this percolation. We know that there exists almost surely a unique infinite…

Probability · Mathematics 2019-01-01 Barbara Dembin

I consider p-Bernoulli bond percolation on graphs of vertex-transitive tilings of the hyperbolic plane with finite sided faces (or, equivalently, on transitive, nonamenable, planar graphs with one end) and on their duals. It is known…

Probability · Mathematics 2012-12-11 Jan Czajkowski
‹ Prev 1 2 3 10 Next ›