On slowly percolating sets of minimal size in bootstrap percolation
zbMATH Open1298.05297MaRDI QIDQ396751FDOQ396751
Authors: Michał Przykucki, F. S. 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
- Maximal percolation time in hypercubes under 2-bootstrap percolation
- Minimal percolating sets in bootstrap percolation
- On the maximum running time in graph bootstrap percolation
- Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
Epidemiology (92D30) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Cellular automata (computational aspects) (68Q80)
Cites Work
- Bootstrap Percolation, the Schröder Numbers, and theN-Kings Problem
- Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
- Metastability effects in bootstrap percolation
- The time of bootstrap percolation with dense initial sets
- The sharp threshold for bootstrap percolation in all dimensions
- Random disease on the square grid
- Minimal percolating sets in bootstrap percolation
- Maximal percolation time in hypercubes under 2-bootstrap percolation
Cited In (24)
- Minimum lethal sets in grids and tori under 3-neighbour bootstrap percolation
- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results
- The time of bootstrap percolation with dense initial sets for all thresholds
- Minimal percolating sets in bootstrap percolation
- Minimum degree conditions for small percolating sets in bootstrap percolation
- Inapproximability results related to monophonic convexity
- Maximal Spanning Time for Neighborhood Growth on the Hamming Plane
- The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
- The maximum infection time of the \(P_3\) convexity in graphs with bounded maximum degree
- Long running times for hypergraph bootstrap percolation
- On the running time of hypergraph bootstrap percolation
- On the \(P_3\)-hull number of Kneser graphs
- The time of bootstrap percolation in two dimensions
- Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box
- The time of bootstrap percolation with dense initial sets
- The maximum infection time in the geodesic and monophonic convexities
- Burning the plane. Densities of the infinite Cartesian grid
- The maximum time of 2-neighbor bootstrap percolation: complexity results
- On the parameterized complexity of the geodesic hull number
- Smallest percolating sets in bootstrap percolation on grids
- Target set selection with maximum activation time
- The P3 infection time is W[1]-hard parameterized by the treewidth
- The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
- On the maximum running time in graph bootstrap percolation
This page was built for publication: On slowly percolating sets of minimal size in bootstrap percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396751)
