中文
相关论文

相关论文: Indistinguishability of Percolation Clusters

200 篇论文

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…

概率论 · 数学 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$,…

概率论 · 数学 2016-08-16 Olle Häggström , Johan Jonasson

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…

概率论 · 数学 2012-07-31 Itai Benjamini , Gady Kozma

Consider percolation on $T\times \mathbb{Z}^d$, the product of a regular tree of degree $k\geq 3$ with the hypercubic lattice $\mathbb{Z}^d$. It is known that this graph has $0<p_c<p_u<1$, so that there are non-trivial regimes in which…

概率论 · 数学 2024-12-23 Tom Hutchcroft , Minghao Pan

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…

概率论 · 数学 2019-08-27 Pengfei Tang

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…

概率论 · 数学 2024-09-20 Tom Hutchcroft , Minghao Pan

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…

概率论 · 数学 2016-08-14 Ádám Timár

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…

概率论 · 数学 2016-05-18 Tom Hutchcroft

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…

概率论 · 数学 2008-03-31 Yuval Peres , Gabor Pete , Ariel Scolnicov

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…

概率论 · 数学 2015-04-28 Daniel Ahlberg , Vladas Sidoravicius , Johan Tykesson

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…

概率论 · 数学 2016-08-14 Adám Timár

This paper explores the link between the ergodicity of the clus-ter equivalence relation restricted to its infinite locus and the indis-tinguishability of infinite clusters. It is an important element of the dictionary connecting orbit…

概率论 · 数学 2014-11-14 Sébastien Martineau

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…

群论 · 数学 2025-08-14 Inhyeok Choi , Donggyun Seo

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…

概率论 · 数学 2020-08-12 Agelos Georgakopoulos , John Haslegrave

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

概率论 · 数学 2014-01-29 Hugo Duminil-Copin , Vladas Sidoravicius , Vincent Tassion

Chifan-Ioana (2010) implies that, for any factor of IID percolation on any nonamenable Cayley graph $G$, there is a countable set of (strong) indistinguishability classes for non-hyperfinite clusters. We introduce quantitative…

概率论 · 数学 2025-12-09 Endre Csóka , Péter Mester , Gábor Pete

We show that for any Cayley graph, the probability (at any $p$) that the cluster of the origin has size n decays at a well-defined exponential rate (possibly 0). For general graphs, we relate this rate being positive in the supercritical…

概率论 · 数学 2008-05-26 Antar Bandyopadhyay , Jeffrey Steif , Adam Timar

We describe infinite clusters which arise in nearest-neighbour percolation for so-called cocycle measures on the square lattice. These measures arise naturally in the study of random transformations. We show that infinite clusters have a…

概率论 · 数学 2007-05-23 Ronald Meester

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…

概率论 · 数学 2019-03-27 Tom Hutchcroft

Using percolation theory, we derive a conceptual definition of deconfinement in terms of cluster formation. The result is readily applicable to infinite volume equilibrium matter as well as to finite size pre-equilibrium systems in nuclear…

高能物理 - 唯象学 · 物理学 2008-11-26 Helmut Satz
‹ 上一页 1 2 3 10 下一页 ›