Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0708.4287

Dynamical sensitivity of the infinite cluster in critical percolation

Yuval Peres·Oded Schramm·Jeffrey E. Steif
View original source ↗Read source document ↗Export metadata ↓

Abstract

In dynamical percolation, the status of every bond is refreshed according to an independent Poisson clock. For graphs which do not percolate at criticality, the dynamical sensitivity of this property was analyzed extensively in the last decade. Here we focus on graphs which percolate at criticality, and investigate the dynamical sensitivity of the infinite cluster. We first give two examples of bounded degree graphs, one which percolates for all times at criticality and one which has exceptional times of nonpercolation. We then make a nearly complete analysis of this question for spherically symmetric trees with spherically symmetric edge probabilities bounded away from 0 and 1. One interesting regime occurs when the expected number of vertices at the nth level that connect to the root at a fixed time is of order n(\log n)^α. R. Lyons (1990) showed that at a fixed time, there is an infinite cluster a.s. if and only if α>1. We prove that the probability that there is an infinite cluster at all times is 1 if α> 2, while this probability is 0 if 1<α\le 2. Within the regime where a.s. there is an infinite cluster at all times, there is yet another type of ``phase transition'' in the behavior of the process: if the expected number of vertices at the nth level connecting to the root at a fixed time is of order n^θwith θ> 2, then the number of connected components of the set of times in [0,1] at which the root does not percolate is finite a.s., while if 1<θ< 2, then the number of such components is infinite with positive probability.

Explore related subjects

math.PR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yuval Peres, Oded Schramm, Jeffrey E. Steif. 2008-03-27. Dynamical sensitivity of the infinite cluster in critical percolation. https://arxiv.org/abs/0708.4287

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Multiple SLEs and Dyson Brownian motion: transition density and Green's function

We consider multiple chordal Schramm-Loewner evolution (SLE) with $κ\in (0,4]$. Under common-time parameterization, we show that the transition density of the driving function of multiple chordal SLEs can be given by the transition density of Dyson Brownian motion and Green's function. This is a companion paper of [FWY24].

math.PR↗
arXiv2026

Asymptotics of the free path length in the periodic Lorentz gas in the Boltzmann-Grad limit

We study the distribution of the free path length in the periodic Lorentz gas in the Boltzmann-Grad limit. For any unimodular Euclidean lattice and any smooth initial velocity distribution, we establish an asymptotic formula for the distribution function of the free path length with a polynomial rate of convergence. The proof combines the dynamical interpretation of the free path length in terms of expanding translates of horospherical orbits on the space of affine lattices, due to Marklof--Strömbergsson, with the effective equidistribution results of Kleinbock--Margulis and Kim. This extends the asymptotic formula of Boca--Zaharescu for the planar case to arbitrary dimension.

math.PR↗
arXiv2026

The smallest singular value for rectangular random matrices with Lévy entries

Let $X=(x_{ij})\in\mathbb{R}^{N\times n}$ be a rectangular random matrix with i.i.d. entries (we assume $N/n\to\mathbf{a}>1$), and denote by $σ_{min}(X)$ its smallest singular value. When entries have mean zero and unit second moment, the celebrated work of Bai-Yin and Tikhomirov show that $n^{-\frac{1}{2}}σ_{min}(X)$ converges almost surely to $\sqrt{\mathbf{a}}-1.$ However, little is known when the second moment is infinite. In this work we consider symmetric entry distributions satisfying $\mathbb{P}(|x_{ij}|>t)\asymp t^{-α}$ for some $α\in(0,2)$, and prove that $σ_{min}(X)$ can be determined up to a log factor with high probability: for any $D>0$, with probability at least $1-n^{-D}$ we have $$C_1n^{\frac{1}α}(\log n)^\frac{2(α-2)}α\leq σ_{min}(X)\leq C_2n^{\frac{1}α}(\log n)^\frac{α-2}{2α}$$ for some constants $C_1,C_2>0$. The upper bound was derived in a recent work of Bao, Lee and Xu \cite{bao2024phase2} but the lower bound is new and answers a problem posed in that paper in a weaker form. This appears to be the first determination of $σ_{min}(X)$ in the $α$-stable case with a correct leading order of $n$, as previous anti-concentration arguments only yield lower bound $n^\frac{1}{2}$. The same lower bound holds for $σ_{min}(X+B)$ for any fixed rectangular matrix $B$ with no assumption on its operator norm. The case of diverging aspect ratio is also computed.

math.PR↗