Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three
From MaRDI portal
Abstract: For , the -neighbour bootstrap process in a graph starts with a set of infected vertices and, in each time step, every vertex with at least infected neighbours becomes infected. The initial infection percolates if every vertex of is eventually infected. We exactly determine the minimum cardinality of a set that percolates for the -neighbour bootstrap process when is a -dimensional grid with minimum side-length at least . We also characterize the integers and for which there is a set of cardinality that percolates for the -neighbour bootstrap process in the grid; this solves a problem raised by Benevides, Bermond, Lesfari and Nisse [HAL Research Report 03161419v4, 2021].
Recommendations
Cites work
- A sharper threshold for bootstrap percolation in two dimensions
- An improved upper bound for bootstrap percolation in all dimensions
- Bootstrap percolation in high dimensions
- Bootstrap percolation in three dimensions
- Bootstrap percolation on the hypercube
- Bootstrap percolation, probabilistic cellular automata and sharpness
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Extremal bounds for bootstrap percolation in the hypercube
- Finite size scaling in three-dimensional bootstrap percolation
- scientific article; zbMATH DE number 5066400 (Why is no real title available?)
- Lower bounds for graph bootstrap percolation via properties of polynomials
- Majority Bootstrap Percolation on the Hypercube
- Mathematical mind-benders
- Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
- Metastability effects in bootstrap percolation
- Monotone cellular automata in a random environment
- Polluted bootstrap percolation in three dimensions
- Proof of Straley's argument for bootstrap percolation.
- Random disease on the square grid
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Slow convergence in bootstrap percolation
- Smallest percolating sets in bootstrap percolation on grids
- Subcritical \(\mathcal{U}\)-bootstrap percolation models have non-trivial phase transitions
- The metastability threshold for modified bootstrap percolation in d dimensions
- The second term for two-neighbour bootstrap percolation in two dimensions
- The sharp threshold for bootstrap percolation in all dimensions
- The sharp threshold for the Duarte model
- The threshold regime of finite volume bootstrap percolation.
Cited in
(7)- Polluted bootstrap percolation in three dimensions
- Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation
- Minimum 2-percolating sets in 2-connected, diameter 2 graphs
- Bootstrap percolation on the high-dimensional Hamming graph
- Spreading in claw-free cubic graphs
- 3-neighbor bootstrap percolation on grids
- On polluted bootstrap percolation in Cartesian grids
This page was built for publication: Extremal Bounds for 3-Neighbor Bootstrap Percolation in Dimensions Two and Three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077983)