Lower bounds for bootstrap percolation on Galton-Watson trees
DOI10.1214/ECP.V19-3315zbMATH Open1298.05064arXiv1402.4462OpenAlexW1972590410MaRDI QIDQ457796FDOQ457796
Authors: Karen Gunderson, Michał Przykucki
Publication date: 29 September 2014
Published in: Electronic Communications in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.4462
Recommendations
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)
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)