Maximal percolation time in hypercubes under 2-bootstrap percolation

zbMath1254.82017MaRDI QIDQ456290

Michał Przykucki

Publication date: 24 October 2012

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

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i2p41

zbMATH Keywords

percolation\(n\)-dimensional hypercube

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Cellular automata (computational aspects) (68Q80) Percolation (82B43)

Related Items (19)

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 ⋮ Contagious sets in dense graphs ⋮ 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 ⋮ Long running times for hypergraph bootstrap percolation ⋮ On the running time of hypergraph bootstrap percolation ⋮ Target set selection with maximum activation time ⋮ A cube dismantling problem related to bootstrap percolation ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ On the maximum running time in graph bootstrap percolation ⋮ Bootstrap Percolation on Degenerate Graphs ⋮ On the \(P_3\)-hull number of Kneser graphs ⋮ The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results ⋮ Maximal Spanning Time for Neighborhood Growth on the Hamming Plane ⋮ The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects

This page was built for publication: Maximal percolation time in hypercubes under 2-bootstrap percolation