Lower bounds for bootstrap percolation on Galton-Watson trees
From MaRDI portal
(Redirected from Publication:457796)
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Cellular automata (computational aspects) (68Q80)
Abstract: Bootstrap percolation is a cellular automaton modelling the spread of an `infection' on a graph. In this note, we prove a family of lower bounds on the critical probability for -neighbour bootstrap percolation on Galton--Watson trees in terms of moments of the offspring distributions. With this result we confirm a conjecture of Bollob'as, Gunderson, Holmgren, Janson and Przykucki. We also show that these bounds are best possible up to positive constants not depending on the offspring distribution.
Recommendations
Cited in
(5)
This page was built for publication: Lower bounds for bootstrap percolation on Galton-Watson trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q457796)