2000 character limit reached
Subcritical monotone cellular automata
Published 3 Mar 2022 in math.PR and math.CO | (2203.01917v2)
Abstract: We study monotone cellular automata (also known as $\mathcal{U}$-bootstrap percolation) in $\mathbb{Z}d$ with random initial configurations. Confirming a conjecture of Balister, Bollob\'as, Przykucki and Smith, who proved the corresponding result in two dimensions, we show that the critical probability is non-zero for all subcritical models.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.