English
Related papers

Related papers: Indistinguishability for recurrent clusters

200 papers

We consider a stationary random field indexed by an increasing sequence of subsets of $\mathbb{Z}^d$ obeying a very broad geometrical assumption on how the sequence expands. Under certain mixing and local conditions, we show how the tail…

Probability · Mathematics 2022-01-19 Anders Rønn-Nielsen , Mads Stehr

In this paper we consider Bernoulli percolation on an infinite connected bounded degrees graph $G$. Assuming the uniqueness of the infinite open cluster and a quasi-multiplicativity of crossing probabilities, we prove the existence of…

Probability · Mathematics 2016-11-15 Deepan Basu , Artem Sapozhnikov

We introduce perhaps the simplest models of graph evolution with choice that demonstrate discontinuous percolation transitions and can be analyzed via mathematical evolution equations. These models are local, in the sense that at each step…

Disordered Systems and Neural Networks · Physics 2011-03-31 Raissa M. D'Souza , Michael Mitzenmacher

It is shown that oriented random walk on the Heisenberg group admits exponential intersection tail. As a corollary we get that on any transitive graph of polynomial volume growth, which is not a finite extension of $\mathbb{Z},…

Probability · Mathematics 2022-02-04 Itai Benjamini , Oded Schramm

We give an example of an invariant bond percolation process on the slab $\mathbb{Z}^2\times \{0,1\}$ with the property that it has infinitely many clusters whose critical percolation probability is strictly less than $1$. We also show that…

Probability · Mathematics 2024-01-30 Péter Mester

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 a nonuniqueness theorem for Bernoulli site percolation on properly embedded planar graphs, and we obtain a general connectivity principle beyond planarity. Let $G$ be an infinite connected graph properly embedded in $\RR^2$ with…

Probability · Mathematics 2026-03-23 Zhongyang Li

Graphs are commonly used to represent and visualize causal relations. For a small number of variables, this approach provides a succinct and clear view of the scenario at hand. As the number of variables under study increases, the graphical…

Machine Learning · Statistics 2023-08-16 Santtu Tikka , Jouni Helske , Juha Karvanen

The random-cluster model, a correlated bond percolation model, unifies a range of important models of statistical mechanics in one description, including independent bond percolation, the Potts model and uniform spanning trees. By…

Statistical Mechanics · Physics 2016-01-28 Eren Metin Elçi , Martin Weigel , Nikolaos G. Fytas

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…

Probability · Mathematics 2007-05-23 Ronald Meester

In this article, we consider a sequence $(N_n)_{n \geq 1}$ of point processes, whose points lie in a subset $E$ of $\bR \verb2\2 \{0\}$, and satisfy an asymptotic independence condition. Our main result gives some necessary and sufficient…

Probability · Mathematics 2010-11-17 Raluca Balan , Sana Louhichi

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

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on $Z^d \times Z_+$. In dimensions $d>6$, we obtain bounds on exit times, transition probabilities, and the range of the…

Probability · Mathematics 2007-09-01 Martin T. Barlow , Antal A. Jarai , Takashi Kumagai , Gordon Slade

We study the behavior of the random walk on the infinite cluster of independent long range percolation in dimensions $d=1,2$, where $x$ and $y$ a re connected with probability $\sim\beta/\|x-y\|^{-s}$. We show that when $d<s<2d$ the walk is…

Probability · Mathematics 2014-03-04 Noam Berger

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

Probability · Mathematics 2014-01-29 Hugo Duminil-Copin , Vladas Sidoravicius , Vincent Tassion

The class of random-cluster models is a unification of a variety of stochastic processes of significance for probability and statistical physics, including percolation, Ising, and Potts models; in addition, their study has impact on the…

Probability · Mathematics 2007-05-23 Geoffrey Grimmett

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 describe a phase transition in continuum limits of interacting particle systems that exhibits a vertical bifurcation diagram. The transition is mediated by a competition short-range repulsion and long-range attraction. As a consequence…

Dynamical Systems · Mathematics 2025-07-15 Arnd Scheel , Angela Stevens

We study the asymptotic behavior the exit times of random walk from Euclidean balls around the origin of the incipient infinite cluster in a manner inspired by [26]. We do this by obtaining bounds on the effective resistance between the…

Probability · Mathematics 2013-12-06 Markus Heydenreich , Remco van der Hofstad , Tim Hulshof

We study existence of percolation in the hierarchical group of order $N$, which is an ultrametric space, and transience and recurrence of random walks on the percolation clusters. The connection probability on the hierarchical group for two…

Probability · Mathematics 2016-02-09 D. A. Dawson , L. G. Gorostiza