A simplified version of Toom's Peierls argument based on Toom contours proves stability for monotone cellular automata with intrinsic randomness and derives lower bounds on critical parameters for deterministic automata.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Peierls bounds from Toom contours
A simplified version of Toom's Peierls argument based on Toom contours proves stability for monotone cellular automata with intrinsic randomness and derives lower bounds on critical parameters for deterministic automata.