Lower bounds for bootstrap percolation on Galton-Watson trees

From MaRDI portal
Publication:457796

DOI10.1214/ECP.V19-3315zbMATH Open1298.05064arXiv1402.4462OpenAlexW1972590410MaRDI QIDQ457796FDOQ457796


Authors: Karen Gunderson, Michał Przykucki Edit this on Wikidata


Publication date: 29 September 2014

Published in: Electronic Communications in Probability (Search for Journal in Brave)

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 r-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.


Full work available at URL: https://arxiv.org/abs/1402.4462




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)