English
Related papers

Related papers: Finite-energy infinite clusters without anchored e…

200 papers

Let $(G_n) = \left((V_n,E_n)\right)$ be a sequence of finite connected vertex-transitive graphs with uniformly bounded vertex degrees such that $\lvert V_n \rvert \to \infty$ as $n \to \infty$. We say that percolation on $G_n$ has a sharp…

Probability · Mathematics 2024-08-23 Philip Easo

The set of all possible configurations of the Ehrenfest wind-tree model endowed with the Hausdorff topology is a compact metric space. For a typical configuration we show that the wind-tree dynamics has infinite ergodic index in almost…

Dynamical Systems · Mathematics 2017-03-16 Alba Málaga , Serge Troubetzkoy

We show how to turn the question of the absolute continuity of Bernoulli convolutions into one of counting the growth of the number of overlaps in the system. When the contraction parameter is a hyperbolic algebraic integer, we turn this…

Dynamical Systems · Mathematics 2021-10-19 Alex Batsis , Tom Kempton

We extend Edmonds' Branching Theorem to locally finite infinite digraphs. As examples of Oxley or Aharoni and Thomassen show, this cannot be done using ordinary arborescences, whose underlying graphs are trees. Instead we introduce the…

Combinatorics · Mathematics 2020-04-06 J. Pascal Gollin , Karl Heuer

We show that the critical probability for percolation on a d-regular non-amenable graph of large girth is close to the critical probability for percolation on an infinite d-regular tree. This is a special case of a conjecture due to O.…

Probability · Mathematics 2009-01-30 Itai Benjamini , Asaf Nachmias , Yuval Peres

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

Combinatorics · Mathematics 2025-11-17 Sahar Diskin , Michael Krivelevich

We investigate the onset of the discontinuous percolation transition in small-world hyperbolic networks by studying the systems-size scaling of the typical largest cluster approaching the transition, $p\nearrow p_{c}$. To this end, we…

Statistical Mechanics · Physics 2014-08-01 Vijay Singh , Stefan Boettcher

We study an interacting particle system in which moving particles activate dormant particles linked by the components of critical bond percolation. Addressing a conjecture from Beckman, Dinan, Durrett, Huo, and Junge for a continuous…

Probability · Mathematics 2020-08-26 Matthew Junge

We prove central limit theorems (CLTs) for topological functionals of Bernoulli bond percolation on infinite graphs beyond the Euclidean lattice $\mathbb{Z}^{d}$. For quasi-transitive graphs of subexponential growth, we show that the number…

Probability · Mathematics 2026-04-10 Luciano H. L. de Araújo , Daniel Miranda Machado , Cristian F. Coletti

We study the percolation model on Boltzmann triangulations using a generating function approach. More precisely, we consider a Boltzmann model on the set of finite planar triangulations, together with a percolation configuration (either…

Combinatorics · Mathematics 2019-08-15 Olivier Bernardi , Nicolas Curien , Grégory Miermont

We introduce a notion of capacity for high dimensional critical percolation by showing that for any finite set $A$, the suitably rescaled probability that the cluster of $z$ intersects $A$ converges as $\|z\|\to\infty$. This can be viewed…

Probability · Mathematics 2025-09-26 Amine Asselah , Bruno Schapira , Perla Sousi

We study a percolation process on the planted binary tree, where clusters freeze as soon as they become larger than some fixed parameter N. We show that as N goes to infinity, the process converges in some sense to the frozen percolation…

Probability · Mathematics 2011-05-11 Jacob van den Berg , Demeter Kiss , Pierre Nolin

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

We consider the Gaussian free field $\varphi$ on $\mathbb{Z}^d$, for $d\geq3$, and give sharp bounds on the probability that the radius of a finite cluster in the excursion set $\{\varphi \geq h\}$ exceeds a large value $N$, for any height…

Probability · Mathematics 2022-09-19 Subhajit Goswami , Pierre-François Rodriguez , Franco Severo

We investigate bond percolation on the non-planar Hanoi network (HN-NP), which was studied in [Boettcher et al. Phys. Rev. E 80 (2009) 041115]. We calculate the fractal exponent of a subgraph of the HN-NP, which gives a lower bound for the…

Disordered Systems and Neural Networks · Physics 2013-03-20 Takehisa Hasegawa , Tomoaki Nogawa

In majority bootstrap percolation on a graph G, an infection spreads according to the following deterministic rule: if at least half of the neighbours of a vertex v are already infected, then v is also infected, and infected vertices remain…

Combinatorics · Mathematics 2007-05-23 József Balogh , Béla Bollobás , Robert Morris

We show that in high dimensional Bernoulli percolation, removing from a thin infinite cluster a much thinner infinite cluster leaves an infinite component. This observation has implications for the van den Berg-Brouwer forest fire process,…

Probability · Mathematics 2015-07-06 Daniel Ahlberg , Hugo Duminil-Copin , Gady Kozma , Vladas Sidoravicius

Let $ \mathbb{L}^{d} = ( \mathbb{Z}^{d},\mathbb{E}^{d} ) $ be the $ d $-dimensional hypercubic lattice. We consider a model of inhomogeneous Bernoulli percolation on $ \mathbb{L}^{d} $ in which every edge inside the $ s $-dimensional…

Probability · Mathematics 2021-07-22 Bernardo N. B. de Lima , Sébastien Martineau , Humberto C. Sanna , Daniel Valesin

We study inhomogeneous Bernoulli bond percolation on the graph $G \times \mathbb{Z}$, where $G$ is a connected quasi-transitive graph. The inhomogeneity is introduced through a random region $R$ around the origin axis…

Probability · Mathematics 2026-02-02 A. Nascimento , R. Sanchis , D. Ungaretti

Schramm's Locality Conjecture asserts that the value of the critical percolation parameter $p_c$ of a graph satisfying $p_c<1$ depends only on its local structure. In this note, we prove this conjecture in the particular case of transitive…

Probability · Mathematics 2022-05-23 Daniel Contreras , Sébastien Martineau , Vincent Tassion