Slow convergence in bootstrap percolation
Gravner, Janko ; Holroyd, Alexander E.
Ann. Appl. Probab., Tome 18 (2008) no. 1, p. 909-928 / Harvested from Project Euclid
In the bootstrap percolation model, sites in an L×L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least two infected neighbors. As (L, p)→(∞, 0), the probability that the entire square is eventually infected is known to undergo a phase transition in the parameter p log L, occurring asymptotically at λ=π2/18 [Probab. Theory Related Fields 125 (2003) 195–224]. We prove that the discrepancy between the critical parameter and its limit λ is at least Ω((log L)−1/2). In contrast, the critical window has width only Θ((log L)−1). For the so-called modified model, we prove rigorous explicit bounds which imply, for example, that the relative discrepancy is at least 1% even when L=103000. Our results shed some light on the observed differences between simulations and rigorous asymptotics.
Publié le : 2008-06-15
Classification:  Bootstrap percolation,  cellular automaton,  metastability,  finite-size scaling,  crossover,  60K35,  82B43
@article{1211819789,
     author = {Gravner, Janko and Holroyd, Alexander E.},
     title = {Slow convergence in bootstrap percolation},
     journal = {Ann. Appl. Probab.},
     volume = {18},
     number = {1},
     year = {2008},
     pages = { 909-928},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1211819789}
}
Gravner, Janko; Holroyd, Alexander E. Slow convergence in bootstrap percolation. Ann. Appl. Probab., Tome 18 (2008) no. 1, pp.  909-928. http://gdmltest.u-ga.fr/item/1211819789/