Bootstrap percolation via automated conjecturing

DOI10.26493/1855-3974.2340.a61OpenAlexW4224028432MaRDI QIDQ5881012

No author found.

Publication date: 9 March 2023

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.2340.a61

zbMATH Keywords

cellular automatapercolationbootstrap percolationautomated conjecturing

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Cellular automata (computational aspects) (68Q80)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Largest and smallest minimal percolating sets in trees
• Bootstrap percolation in three dimensions
• Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
• Sharp metastability threshold for two-dimensional bootstrap percolation
• Finite size scaling in three-dimensional bootstrap percolation
• Contagious sets in dense graphs
• Automated conjecturing. III. Property-relations conjectures
• Percolation in dense storage arrays
• Nucleation and growth for the Ising model in \(d\) dimensions at very low temperatures
• The threshold regime of finite volume bootstrap percolation.
• A generalization of chordal graphs
• Metastability effects in bootstrap percolation
• Dually Chordal Graphs
• Monotone Cellular Automata in a Random Environment
• The sharp threshold for bootstrap percolation in all dimensions