2000 character limit reached
Universality for monotone cellular automata (2203.13806v3)
Published 25 Mar 2022 in math.PR, math-ph, math.CO, and math.MP
Abstract: In this paper we study monotone cellular automata in $d$ dimensions. We develop a general method for bounding the growth of the infected set when the initial configuration is chosen randomly, and then use this method to prove a lower bound on the critical probability for percolation that is sharp up to a constant factor in the exponent for every 'critical' model. This is one of three papers that together confirm the Universality Conjecture of Bollob\'as, Duminil-Copin, Morris and Smith.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.