SearcharxivSearch

arXiv · 1311.5883

Subcritical $\mathcal{U}$-bootstrap percolation models have non-trivial phase transitions

Abstract

We prove that there exist natural generalizations of the classical bootstrap percolation model on $\mathbb{Z}^2$ that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Van Enter (in the case $d=r=2$) and Schonmann (for all $d \geq r \geq 2$) proved that $r$-neighbour bootstrap percolation models have trivial critical probabilities on $\mathbb{Z}^d$ for every choice of the parameters $d \geq r \geq 2$: that is, an initial set of density $p$ almost surely percolates $\mathbb{Z}^d$ for every $p>0$. These results effectively ended the study of bootstrap percolation on infinite lattices. Recently Bollob\'as, Smith and Uzzell introduced a broad class of percolation models called $\mathcal{U}$-bootstrap percolation, which includes $r$-neighbour bootstrap percolation as a special case. They divided two-dimensional $\mathcal{U}$-bootstrap percolation models into three classes -- subcritical, critical and supercritical -- and they proved that, like classical 2-neighbour bootstrap percolation, critical and supercritical $\mathcal{U}$-bootstrap percolation models have trivial critical probabilities on $\mathbb{Z}^2$. They left open the question as to what happens in the case of subcritical families. In this paper we answer that question: we show that every subcritical $\mathcal{U}$-bootstrap percolation model has a non-trivial critical probability on $\mathbb{Z}^2$. This is new except for a certain `degenerate' subclass of symmetric models that can be coupled from below with oriented site percolation. Our results re-open the study of critical probabilities in bootstrap percolation on infinite lattices, and they allow one to ask many questions of subcritical bootstrap percolation models that are typically asked of site or bond percolation.

Explore related subjects

Keep this discovery

BibTeXRIS

Paul Balister, Béla Bollobás, Michał Przykucki, Paul Smith. 2013-11-22. Subcritical $\mathcal{U}$-bootstrap percolation models have non-trivial phase transitions. https://arxiv.org/abs/1311.5883

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR