The time of bootstrap percolation with dense initial sets for all thresholds
arXiv:1209.4339
Abstract
We study the percolation time of the -neighbour bootstrap percolation model on the discrete torus . For at most a polylog function of and initial infection probabilities within certain ranges depending on , we prove that the percolation time of a random subset of the torus is exactly equal to with high probability as tends to infinity. Our proof rests crucially on three new extremal theorems that together establish an almost complete understanding of the geometric behaviour of the -neighbour bootstrap process in the dense setting. The special case of our result was proved recently by Bollobás, Holmgren, Smith and Uzzell.
arXiv comment27 pages, 4 figures
References in corpus (6)
- Bootstrap percolation on the random graph
- Bootstrap percolation in three dimensions
- On Bootstrap Percolation in Living Neural Networks
- Remarks on Bootstrap Percolation in Metric Networks
- Exact Solution of a Jamming Transition: Closed Equations for a Bootstrap Percolation Problem
- The time of bootstrap percolation in two dimensions