Work

Bootstrap Percolation in High Dimensions

Year: 2010
Type: article
Abstract: Inr-neighbour bootstrap percolation on a graphG, a set of initially infected verticesA⊂V(G) is chosen independently at random, with densityp, and new vertices are subsequently infected if they have at leastrinfected neighbours. The setAis said to percolate if eventually all vertices are infected. Our aim is to understand this process on the grid, [n]d, for arbitrary functionsn=n(t),d=d(t) andr=r(t), ast→ ∞. The main question is to determine the critical probabilitypc([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 whenr= 2, for all functionsnanddsatisfyingd≫ logn. The bootstrap process has been extensively studied on [n]dwhendis a fixed constant and 2 ⩽r⩽d, and in these casespc([n]d,r) has recently been determined up to a factor of 1 +o(1) asn→ ∞. At the other end of the scale, Balogh and Bollobás determinedpc([2]d, 2) up to a constant factor, and Balogh, Bollobás and Morris determinedpc([n]d,d) asymptotically ifd≥ (log logn)2+ϵ, and gave much sharper bounds for the hypercube. Here we prove the following result. Let λ be the smallest positive root of the equation so λ ≈ 1.166. Then ifdis sufficiently large, and moreover asd→ ∞, for every functionn=n(d) withd≫ logn.
Language: English
Open Access status: green
OpenAlex ID: W2008489121
FWCI: 6.475
Cites: 31
Cited by: 99
Related to: 10