Minimal percolating sets in bootstrap percolation

zbMath1178.60070arXivmath/0702370MaRDI QIDQ1010903

Robert Morris

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Related Items (22)

Deterministic bootstrap percolation on trees ⋮ The time of bootstrap percolation with dense initial sets for all thresholds ⋮ Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box ⋮ Neighborhood growth dynamics on the Hamming plane ⋮ The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results ⋮ Minimum degree conditions for small percolating sets in bootstrap percolation ⋮ On slowly percolating sets of minimal size in bootstrap percolation ⋮ The maximum time of 2-neighbor bootstrap percolation: complexity results ⋮ The time of bootstrap percolation with dense initial sets ⋮ Target set selection with maximum activation time ⋮ A cube dismantling problem related to bootstrap percolation ⋮ Triggering cascades on undirected connected graphs ⋮ A sharper threshold for bootstrap percolation in two dimensions ⋮ Smallest percolating sets in bootstrap percolation on grids ⋮ Bootstrap percolation on the random graph \(G_{n,p}\) ⋮ On the maximum running time in graph bootstrap percolation ⋮ On the \(P_3\)-hull number of Kneser graphs ⋮ Large deviations for subcritical bootstrap percolation on the Erdős-Rényi graph ⋮ The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results ⋮ Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results ⋮ The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects ⋮ Minimal contagious sets in random regular graphs

This page was built for publication: Minimal percolating sets in bootstrap percolation