A Note on Bootstrap Percolation Thresholds in Plane Tilings using Regular Polygons
From MaRDI portal
Publication:5197613
zbMath1419.05153arXiv1803.09056MaRDI QIDQ5197613
Neal Bushaw, Daniel W. Cranston
Publication date: 19 September 2019
Full work available at URL: https://arxiv.org/abs/1803.09056
Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Combinatorial aspects of tessellation and tiling problems (05B45) Infinite graphs (05C63)
Cites Work
- Majority bootstrap percolation on \(G(n,p)\)
- Bootstrap percolation on the random graph \(G_{n,p}\)
- Bootstrap percolation in three dimensions
- On the behavior of some cellular automata related to bootstrap percolation
- Sharp metastability threshold for two-dimensional bootstrap percolation
- Finite size scaling in three-dimensional bootstrap percolation
- Proof of Straley's argument for bootstrap percolation.
- The threshold regime of finite volume bootstrap percolation.
- Percolation
- Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
- Bootstrap percolation on the random regular graph
- Majority Bootstrap Percolation on the Hypercube
- Metastability effects in bootstrap percolation
- Tilings by Regular Polygons
- Monotone Cellular Automata in a Random Environment
- The sharp threshold for bootstrap percolation in all dimensions