On slowly percolating sets of minimal size in bootstrap percolation

zbMath1298.05297MaRDI QIDQ396751

Michał Przykucki, Fabrício Siqueira Benevides

Publication date: 14 August 2014

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/v20i2p46

zbMATH Keywords

gridbootstrap percolationmaximum time

Mathematics Subject Classification ID

Epidemiology (92D30) Applications of graph theory (05C90) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Cellular automata (computational aspects) (68Q80) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (22)

The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree ⋮ The time of bootstrap percolation in two dimensions ⋮ 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 ⋮ The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results ⋮ Minimum degree conditions for small percolating sets 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 ⋮ The maximum infection time in the geodesic and monophonic convexities ⋮ The P3 infection time is W[1-hard parameterized by the treewidth] ⋮ Smallest percolating sets in bootstrap percolation on grids ⋮ Burning the plane. Densities of the infinite Cartesian grid ⋮ Inapproximability results related to monophonic convexity ⋮ On the maximum running time in graph bootstrap percolation ⋮ On the parameterized complexity of the geodesic hull number ⋮ 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

Cites Work

• The time of bootstrap percolation with dense initial sets
• Maximal percolation time in hypercubes under 2-bootstrap percolation
• Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
• Minimal percolating sets in bootstrap percolation
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Metastability effects in bootstrap percolation
• Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
• Random disease on the square grid
• The sharp threshold for bootstrap percolation in all dimensions

This page was built for publication: On slowly percolating sets of minimal size in bootstrap percolation