Related papers: Uniqueness and non-uniqueness in percolation theor…
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…
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…
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…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
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…
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…
We study percolation on nonamenable groups at the uniqueness threshold $p_u$, the critical value that separates the phase in which there are infinitely many infinite clusters from the phase in which there is a unique infinite cluster. The…
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…
In this paper, we alternately obtain the almost sure uniqueness of the infinite open cluster in bond percolation in $\mathbb{Z}^d, d \geq 2,$ without requiring the use of ergodicity of translation action. If $N$ denotes the number of…
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…
We show that there exists a connected graph G with subexponential volume growth such that critical percolation on the product of G with the line has infinitely many infinite clusters. We also give some conditions under which this cannot…
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…
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…
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…
A question relating the critical probability for percolation, the critical probability for a unique infinite cluster and graph limits is presented, together with some partial results.
We present a comprehensive and versatile theoretical framework to study site and bond percolation on clustered and correlated random graphs. Our contribution can be summarized in three main points. (i) We introduce a set of iterative…
The main goal of this paper is to answer question 1.10 and settle conjecture 1.11 of Benjamini-Lyons-Schramm [BLS99] relating harmonic Dirichlet functions on a graph to those of the infinite clusters in the uniqueness phase of Bernoulli…
The Burton--Keane theorem for the almost-sure uniqueness of infinite clusters is a landmark of stochastic geometry. Let $\mu$ be a translation-invariant probability measure with the finite-energy property on the edge-set of a…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
We consider a broad class of dependent site-percolation models on $\mathbb{Z}^d$ obtained by applying a monotone automaton to a random initial particle configuration drawn from a stochastically increasing family of measures. We prove that…