English
Related papers

Related papers: Heavy Bernoulli-percolation clusters are indisting…

200 papers

We study Bernoulli bond percolation on nonunimodular quasi-transitive graphs, and more generally graphs whose automorphism group has a nonunimodular quasi-transitive subgroup. We prove that percolation on any such graph has a non-empty…

Probability · Mathematics 2020-02-26 Tom Hutchcroft

We extend some of the fundamental results about percolation on unimodular nonamenable graphs to nonunimodular graphs. We show that they cannot have infinitely many infinite clusters at critical Bernoulli percolation. In the case of heavy…

Probability · Mathematics 2016-08-14 Ádám Timár

We prove that Bernoulli bond percolation on any nonamenable, Gromov hyperbolic, quasi-transitive graph has a phase in which there are infinitely many infinite clusters, verifying a well-known conjecture of Benjamini and Schramm (1996) under…

Probability · Mathematics 2019-03-27 Tom Hutchcroft

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…

Probability · Mathematics 2016-08-14 Adám Timár

We establish several equivalent characterisations of the anchored isoperimetric dimension of supercritical clusters in Bernoulli bond percolation on transitive graphs. We deduce from these characterisations together with a theorem of…

Probability · Mathematics 2022-07-13 Tom Hutchcroft

We study Bernoulli$(p)$ percolation on (non)unimodular quasi-transitive graphs and prove that, almost surely, for any two heavy clusters $C$ and $C'$, the set of vertices in $C$ within distance one of $C'$ is light, i.e. it has finite total…

Probability · Mathematics 2025-09-17 Sasha Bell , Tasmin Chu , Owen Rodgers , Grigory Terlov , Anush Tserunyan

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…

Probability · Mathematics 2015-04-28 Daniel Ahlberg , Vladas Sidoravicius , Johan Tykesson

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

An important conjecture in percolation theory is that almost surely no infinite cluster exists in critical percolation on any transitive graph for which the critical probability is less than 1. Earlier work has established this for the…

Probability · Mathematics 2008-03-31 Yuval Peres , Gabor Pete , Ariel Scolnicov

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…

Probability · Mathematics 2016-05-18 Tom Hutchcroft

We prove that for a non-amenable, locally finite, connected, transitive, planar graph with one end, any automorphism invariant site percolation on the graph does not have exactly 1 infinite 1-cluster and exactly 1 infinite 0-cluster a.s. If…

Probability · Mathematics 2022-03-07 Zhongyang Li

We study the distribution of finite clusters in slightly supercritical ($p \downarrow p_c$) Bernoulli bond percolation on transitive nonamenable graphs, proving in particular that if $G$ is a transitive nonamenable graph satisfying the…

Probability · Mathematics 2022-07-28 Tom Hutchcroft

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| <…

Probability · Mathematics 2020-10-06 Jonathan Hermon , Tom Hutchcroft

Let $(G_n)$ be a sequence of finite connected vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)$ is a percolation threshold if for every $\varepsilon > 0$, the proportion $\left\lVert K_1…

Probability · Mathematics 2024-03-13 Philip Easo

Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…

Probability · Mathematics 2024-03-12 Philip Easo , Tom Hutchcroft

We construct an example of a bounded degree, nonamenable, unimodular random rooted graph with $p_c=p_u$ for Bernoulli bond percolation, as well as an example of a bounded degree, unimodular random rooted graph with $p_c<1$ but with an…

Probability · Mathematics 2017-10-10 Omer Angel , Tom Hutchcroft

We introduce a general framework to show the indistinguishability of infinite clusters (ergodicity of the cluster subrelation) in group-invariant percolation processes with a weaker version of the finite energy property: the possibility of…

Probability · Mathematics 2025-12-23 Damis El Alami , Gábor Pete , Ádám Timár

This paper is an up-to-date introduction to the problem of uniqueness versus non-uniqueness of infinite clusters for percolation on ${\mathbb{Z}}^d$ and, more generally, on transitive graphs. For iid percolation on ${\mathbb{Z}}^d$,…

Probability · Mathematics 2016-08-16 Olle Häggström , Johan Jonasson

Let $G$ be an acylindrically hyperbolic group. We prove that Bernoulli bond percolation on every Cayley graph of $G$ has a nonuniqueness phase, in which there are infinitely many infinite clusters. This generalizes Hutchcroft's result for…

Group Theory · Mathematics 2025-08-14 Inhyeok Choi , Donggyun Seo

We show that when percolation produces infinitely many infinite clusters on a Cayley graph, one cannot distinguish the clusters from each other by any invariantly defined property. This implies that uniqueness of the infinite cluster is…

Probability · Mathematics 2008-11-26 Russell Lyons , Oded Schramm
‹ Prev 1 2 3 10 Next ›