Lower bounds for bootstrap percolation on Galton-Watson trees
Lower bounds for bootstrap percolation on Galton-Watson trees
Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family lower bounds on the critical probability for r-neighbour bootstrap percolation on Galton-Watson trees in terms of moments of the offspring distributions. With this result we confirm a conjecture …