Bootstrap Percolation on Degenerate Graphs
From MaRDI portal
Publication:4685764
DOI10.1007/978-3-319-89920-6_41zbMath1397.60129arXiv1605.07002OpenAlexW2963929917MaRDI QIDQ4685764
Publication date: 9 October 2018
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.07002
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Processes in random environments (60K37)
Cites Work
- The time of bootstrap percolation with dense initial sets
- Largest and smallest minimal percolating sets in trees
- Maximal percolation time in hypercubes under 2-bootstrap percolation
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Glauber dynamics for the mean-field Ising model: cut-off, critical power law, and metastability
- Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Bootstrap percolation on Galton-Watson trees
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
- Bootstrap Percolation on Periodic Trees
- The sharp threshold for bootstrap percolation in all dimensions
This page was built for publication: Bootstrap Percolation on Degenerate Graphs