Deterministic bootstrap percolation in high dimensional grids

In this paper, we study the k-neighbor bootstrap percolation process on the d-dimensional grid [n]^d, and show that the minimum number of initial vertices that percolate is (1-d/k)n^d + O(n^{d-1})$ when d<=k<=2d. This confirms a conjecture of Pete.

[1]  John von Neumann,et al.  Theory Of Self Reproducing Automata , 1967 .

[2]  P. Leath,et al.  Bootstrap percolation on a Bethe lattice , 1979 .

[3]  Michael Aizenman,et al.  Metastability effects in bootstrap percolation , 1988 .

[4]  Emilio N.M. Cirillo,et al.  Finite Size Scaling in Three-Dimensional Bootstrap Percolation , 1998 .

[5]  F. Manzo,et al.  The Threshold Regime of Finite Volume Bootstrap Percolation , 2001 .

[6]  A. Holroyd.  Sharp metastability threshold for two-dimensional bootstrap percolation , 2002, math/0206132.

[7]  Joan Adler,et al.  Bootstrap Percolation: visualizations and applications , 2003 .

[8]  Yuval Peres,et al.  Bootstrap Percolation on Infinite Trees and Non-Amenable Groups , 2003, Combinatorics, Probability and Computing.

[9]  József Balogh,et al.  Bootstrap percolation on the random regular graph , 2007, Random Struct. Algorithms.

[10]  Robert Morris.  Minimal Percolating Sets in Bootstrap Percolation , 2009, Electron. J. Comb..

[11]  Eric Riedl,et al.  Largest Minimal Percolating Sets in Hypercubes under 2-Bootstrap Percolation , 2010, Electron. J. Comb..

[12]  Béla Bollobás,et al.  Bootstrap Percolation in High Dimensions , 2009, Combinatorics, Probability and Computing.

[13]  H. Duminil-Copin,et al.  The sharp threshold for bootstrap percolation in all dimensions , 2010, 1010.3326.

[14]  Svante Janson,et al.  Majority bootstrap percolation on the random graph G(n,p) , 2010, 1012.3535.

[15]  Michal Przykucki.  Maximal Percolation Time in Hypercubes Under 2-Bootstrap Percolation , 2012, Electron. J. Comb..

[16]  S. Janson,et al.  Bootstrap percolation on Galton-Watson trees , 2013, 1304.2260.