Maximal percolation time in hypercubes under 2-bootstrap percolation

MaRDI QIDQ456290zbMATH OpenFDO

Authors 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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

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)

Recommendations

• Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box
• Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• On slowly percolating sets of minimal size in bootstrap percolation
• Maximal induced paths and minimal percolating sets in hypercubes

Cited in

(31)

• The time of bootstrap percolation with dense initial sets for all thresholds
• 3-neighbor bootstrap percolation on grids
• Maximum Percolation Time in Two-Dimensional Bootstrap Percolation
• Minimum degree conditions for small percolating sets in bootstrap percolation
• Slow graph bootstrap percolation. II: Accelerating properties
• The Maximum Time of 2-Neighbour Bootstrap Percolation: Complexity Results
• Maximal induced paths and minimal percolating sets in hypercubes
• Bootstrap percolation, connectivity, and graph distance
• On the \(P_3\)-hull number of Kneser graphs
• Long running times for hypergraph bootstrap percolation
• On the running time of hypergraph bootstrap percolation
• scientific article; zbMATH DE number 6302977 (Why is no real title available?)
• Slow graph bootstrap percolation. I: Cycles
• On slowly percolating sets of minimal size in bootstrap percolation
• The time of bootstrap percolation with dense initial sets
• Maximal bootstrap percolation time on the hypercube via generalised snake-in-the-box
• Largest minimal percolating sets in hypercubes under 2-bootstrap percolation
• The maximum length of K_r-bootstrap percolation
• Bootstrap percolation on the hypercube
• A cube dismantling problem related to bootstrap percolation
• Maximal spanning time for neighborhood growth on the Hamming plane
• Burning the plane. Densities of the infinite Cartesian grid
• Bootstrap percolation on the high-dimensional Hamming graph
• Bootstrap Percolation on Degenerate Graphs
• The maximum time of 2-neighbor bootstrap percolation: complexity results
• Bootstrap percolation in strong products of graphs
• Target set selection with maximum activation time
• The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects
• The maximal running time of hypergraph bootstrap percolation
• The maximum time of 2-neighbour bootstrap percolation in grid graphs and parametrized results
• On the maximum running time in graph bootstrap percolation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456290)