An improved upper bound for bootstrap percolation in all dimensions

From MaRDI portal
Publication:5222565




Abstract: In r-neighbor bootstrap percolation on the vertex set of a graph G, a set A of initially infected vertices spreads by infecting, at each time step, all uninfected vertices with at least r previously infected neighbors. When the elements of A are chosen independently with some probability p, it is natural to study the critical probability pc(G,r) at which it becomes likely that all of V(G) will eventually become infected. Improving a result of Balogh, Bollob'as, and Morris, we give a bound on the second term in the expansion of the critical probability when G=[n]d and dgeqrgeq2. We show that for all dgeqrgeq2 there exists a constant cd,r>0 such that if n is sufficiently large, then [ p_c([n]^d, r) leq Biggl(dfrac{lambda(d,r)}{log_{(r-1)}(n)} - dfrac{c_{d,r}}{�igl(log_{(r-1)}(n)�igr)^{3/2}}Biggr)^{d-r+1}, ] where lambda(d,r) is an exact constant and log(k)(n) denotes the k-times iterated natural logarithm of n.









This page was built for publication: An improved upper bound for bootstrap percolation in all dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5222565)