Scholarlink

<p>For deterministic monotone cellular automata on the <i>d</i>-dimensional integer lattice, Toom has given necessary and sufficient conditions for the all-one fixed point to be stable against small random perturbations. The proof of sufficiency is based on an intricate Peierls argument. We present a simplified version of this Peierls argument. Our main motivation is the open problem of determining stability of monotone cellular automata with intrinsic randomness, in which for the unperturbed evolution the local update rules at different space-time points are chosen in an i.i.d. fashion according to some fixed law. We apply Toom’s Peierls argument to prove stability of a class of cellular automata with intrinsic randomness and also derive lower bounds on the critical parameter for some deterministic cellular automata.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Peierls Bounds from Toom Contours

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2026年5月11日

查看全文
  • Jan M. Swart,
  • Réka Szabó,
  • Cristina Toninelli

摘要

For deterministic monotone cellular automata on the d-dimensional integer lattice, Toom has given necessary and sufficient conditions for the all-one fixed point to be stable against small random perturbations. The proof of sufficiency is based on an intricate Peierls argument. We present a simplified version of this Peierls argument. Our main motivation is the open problem of determining stability of monotone cellular automata with intrinsic randomness, in which for the unperturbed evolution the local update rules at different space-time points are chosen in an i.i.d. fashion according to some fixed law. We apply Toom’s Peierls argument to prove stability of a class of cellular automata with intrinsic randomness and also derive lower bounds on the critical parameter for some deterministic cellular automata.