The second term for two-neighbour bootstrap percolation in two dimensions
arXiv:1806.08931 · doi:10.1090/tran/7828
Abstract
In the -neighbour bootstrap process on a graph , vertices are infected (in each time step) if they have at least already-infected neighbours. Motivated by its close connections to models from statistical physics, such as the Ising model of ferromagnetism, and kinetically constrained spin models of the liquid-glass transition, the most extensively-studied case is the two-neighbour bootstrap process on the two-dimensional grid . Around 15 years ago, in a major breakthrough, Holroyd determined the sharp threshold for percolation in this model, and his bounds were subsequently sharpened further by Gravner and Holroyd, and by Gravner, Holroyd and Morris. In this paper we strengthen the lower bound of Gravner, Holroyd and Morris by proving that the critical probability for percolation in the two-neighbour model on satisfies \[p_c\big( [n]^2,2 \big) = \frac{π^2}{18\log n} - \frac{Θ(1)}{(\log n)^{3/2}}\,.\] The proof of this result requires a very precise understanding of the typical growth of a critical droplet, and involves a number of technical innovations. We expect these to have other applications, for example, to the study of more general two-dimensional cellular automata, and to the -neighbour process in higher dimensions.
53 pages, 6 figures, 1 appendix
References in corpus (2)
Cited by in corpus (10)
- Refined universality for critical KCM: lower bounds
- Sharp threshold for the FA-2f kinetically constrained model
- -bootstrap percolation: critical probability, exponential decay and applications
- Refined universality for critical KCM: upper bounds
- Complexity of 2D bootstrap percolation difficulty: Algorithm and NP-hardness
- On the Running Time of Hypergraph Bootstrap Percolation
- Maximal Bootstrap Percolation Time on the Hypercube via Generalised Snake-in-the-Box
- Sensitive bootstrap percolation second term
- Fredrickson--Andersen model in two dimensions
- Locality approach to the bootstrap percolation paradox