Mathematics – Probability
Scientific paper
2010-10-16
Mathematics
Probability
37 pages, sketch of the proof added, to appear in Trans. of the AMS
Scientific paper
In r-neighbour bootstrap percolation on a graph G, a (typically random) set A of initially 'infected' vertices spreads by infecting (at each time step) vertices with at least r already-infected neighbours. This process may be viewed as a monotone version of the Glauber dynamics of the Ising model, and has been extensively studied on the d-dimensional grid $[n]^d$. The elements of the set A are usually chosen independently, with some density p, and the main question is to determine $p_c([n]^d,r)$, the density at which percolation (infection of the entire vertex set) becomes likely. In this paper we prove, for every pair $d \ge r \ge 2$, that there is a constant L(d,r) such that $p_c([n]^d,r) = [(L(d,r) + o(1)) / log_(r-1) (n)]^{d-r+1}$ as $n \to \infty$, where $log_r$ denotes an r-times iterated logarithm. We thus prove the existence of a sharp threshold for percolation in any (fixed) number of dimensions. Moreover, we determine L(d,r) for every pair (d,r).
Balogh József
Bollobas Bela
Duminil-Copin Hugo
Morris Robert
No associations
LandOfFree
The sharp threshold for bootstrap percolation in all dimensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The sharp threshold for bootstrap percolation in all dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The sharp threshold for bootstrap percolation in all dimensions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-181806