Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 0907.3097

Bootstrap percolation in high dimensions

Jozsef Balogh·Bela Bollobas·Robert Morris
View original source ↗Read source document ↗Export metadata ↓

Abstract

In r-neighbour bootstrap percolation on a graph G, a set of initially infected vertices A \subset V(G) is chosen independently at random, with density p, and new vertices are subsequently infected if they have at least r infected neighbours. The set A is said to percolate if eventually all vertices are infected. Our aim is to understand this process on the grid, [n]^d, for arbitrary functions n = n(t), d = d(t) and r = r(t), as t -> infinity. The main question is to determine the critical probability p_c([n]^d,r) at which percolation becomes likely, and to give bounds on the size of the critical window. In this paper we study this problem when r = 2, for all functions n and d satisfying d \gg log n. The bootstrap process has been extensively studied on [n]^d when d is a fixed constant and 2 \leq r \leq d, and in these cases p_c([n]^d,r) has recently been determined up to a factor of 1 + o(1) as n -> infinity. At the other end of the scale, Balogh and Bollobas determined p_c([2]^d,2) up to a constant factor, and Balogh, Bollobas and Morris determined p_c([n]^d,d) asymptotically if d > (log log n)^{2+\eps}, and gave much sharper bounds for the hypercube. Here we prove the following result: let λbe the smallest positive root of the equation \sum_{k=0}^\infty (-1)^k λ^k / (2^{k^2-k} k!) = 0, so λ\approx 1.166. Then (16λ/ d^2) (1 + (log d / \sqrt{d})) 2^{-2\sqrt{d}} < p_c([2]^d,2) < (16λ/ d^2) (1 + (5(log d)^2 / \sqrt{d})) 2^{-2\sqrt{d}} if d is sufficiently large, and moreover we determine a sharp threshold for the critical probability p_c([n]^d,2) for every function n = n(d) with d \gg log n.

Explore related subjects

math.PRmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jozsef Balogh, Bela Bollobas, Robert Morris. 2010-07-14. Bootstrap percolation in high dimensions. https://arxiv.org/abs/0907.3097

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

KEEP EXPLORING

Related papers

arXiv2026

Local well-posedness of general mean field game master equations

This paper presents a generic approach for establishing mean field game master equations, applicable whenever the mean field equilibrium can be characterized by a McKean-Vlasov forward-backward stochastic differential equation system. The core of our approach is a representation formula for the first-order Lions derivative of the decoupling field of this forward-backward SDE system. We then employ a bootstrap argument to recursively compute its higher-order derivatives. To demonstrate the method's versatility, we establish the local well-posedness for master equations in three distinct models: extended mean field games, mean field games with volatility control, and mean field games with a major player.

math.PR↗
arXiv2026

Uniqueness for nonlinear Fokker-Planck equations with general diffusion terms and their associated nonlinear Markov processes

This work is concerned with the uniqueness of distributional solutions to nonlinear Fokker-Planck equations with non-diagonal diffusion terms of type \begin{equation} u_{t}-\sum_{i,j=1}^{d} D^{2}_{ij}(a_{ij}(x)β(x,u))+ \text{div}(b(x,u)u)=0 \quad \text{in}\; (0, \infty) \times \mathbb{R}^{d} ,\notag \end{equation} with initial condition $u(0,x)\equiv u_{0}(x)$, where $a_{ij}$, $β$, and $b$ are suitable functions. Under suitable assumptions, this equation generates a continuous contraction semigroup $S(t): L^{1}(\mathbb{R}^{d}) \rightarrow L^{1}(\mathbb{R}^{d})$, and $u(t)=S(t)u_{0}$ is a mild solution to the equation. Our main contribution is to prove that this mild solution is unique in the much larger class of distributional solutions. This extends previous uniqueness results for the diagonal (also called isotropic) diffusion case $a_{ij} \equiv δ_{ij}$. Another key analytical result of this paper is the uniqueness for distributional solutions of the associated linearized equation. As a main application, we prove weak uniqueness for the corresponding McKean-Vlasov SDEs. Moreover, we prove that, the probabilistically weak solution to the McKean-Vlasov SDEs is also the unique probabilistically strong solution. Furthermore, we establish a new $L^{\infty}$ estimate for mild solutions starting from data in $L^{1}\cap L^{\infty}$ and this estimate is used in the construction of nonlinear Markov processes. Finally, we prove that the path laws of the solutions to the McKean-Vlasov SDEs form a nonlinear Markov process in the sense of McKean.

math.PR↗
arXiv2026

Small-time annealed large deviations principle for one-dimensional diffusions in a random environment

In this paper, we establish a small-time annealed path large deviation principle for one-dimensional diffusions in a random environment associated with the generator ${\mathcal L}_W f(x)=e^{-ρ(x,W)}(e^{a(x,W)}f'(x))'$. The coefficients $\{ρ(x,\cdot):x\in\mathbb R\}$ and $\{a(x,\cdot):x\in\mathbb R\}$ are random. We assume that for each fixed realization of the environment, $ρ$ and $a$ are continuous and locally exponentially integrable, and that the support of the associated intrinsic coordinates is compact and non-collapsing. This framework includes the extensively studied Brox diffusion $dX_t=dB_t-\frac12\dot W(X_t)\,dt$, where $B$ is a standard Brownian motion and $W$ is an independent two-sided Brownian motion representing the environment. The Itô--McKean representation of the diffusions and the estimates of the first exit probabilities derived via Moser iteration play a crucial role.

math.PR↗