Slow graph bootstrap percolation II: Accelerating properties
Authors:
- David FabianDFDavid Fabian
- Patrick MorrisPMPatrick Morris
- Tibor SzabóTSTibor Szabó
- 27 December 2024
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 172, 44-79
Abstract
No abstract availableAll Related Versions
Funding Information
- EU Framework Programme for Research and Innovation Marie Skłodowska-Curie Actions
- German Research Foundation
This publication has 11 references indexed in Scilit:
- The Maximal Running Time of Hypergraph Bootstrap PercolationSIAM Journal on Discrete Mathematics, 2024
- Long running times for hypergraph bootstrap percolationEuropean Journal of Combinatorics, 2023
- Bootstrap percolation, and other automataEuropean Journal of Combinatorics, 2017
- The time of graph bootstrap percolationRandom Structures & Algorithms, 2016
- The time of bootstrap percolation in two dimensionsProbability Theory and Related Fields, 2015
- Maximum Percolation Time in Two-Dimensional Bootstrap PercolationSIAM Journal on Discrete Mathematics, 2015
- The time of bootstrap percolation with dense initial setsThe Annals of Probability, 2014
- The time of bootstrap percolation with dense initial sets for all thresholdsRandom Structures & Algorithms, 2014
- Graph bootstrap percolationRandom Structures & Algorithms, 2012
- Bootstrap percolation on a Bethe latticeJournal of Physics C: Solid State Physics, 1979