An improved lower bound for the critical parameter of Stavskaya's process

DOI10.1017/S0004972720000404MaRDI QIDQ5138967zbMATH OpenFDO

Authors Calitéia S. Sousa, Pablo M. Rodríguez, Paula Cadavid, Alex D. Ramos

Publication date 4 December 2020

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2001.11545

zbMATH Keywords

one-dimensional local interactionparticle random processphase transitionprobabilistic cellular automataStavskaya's process

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Abstract: We consider the Stavskaya's process, which is a two-states Probabilistic Celular Automata defined on a one-dimensional lattice. The process is defined in such a way that the state of any vertex depends only on itself and on the state of its right-adjacent neighbor. This process was one of the first multicomponent systems with local interaction, for which has been proved rigorously the existence of a kind of phase transition. However, the exact localization of its critical value remains as an open problem. In this work we provide a new lower bound for the critical value. The last one was obtained by Andrei Toom, fifty years ago.

Recommendations

• Variable-length analog of Stavskaya process: a new example of misleading simulation
• On periodic processes of percolation cellular automata.
• Improved upper bounds for the contact process critical value
• Critical probabilities and convergence time of percolation probabilistic cellular automata
• Critical points of two-dimensional bootstrap percolation-like cellular automata

Cites work

• Algorithmical unsolvability of the ergodicity problem for binary cellular automata
• Contact interactions on a lattice
• Contours, convex sets and cellular automata. IMPA mathematical publications. 23rd Brazilian mathematics colloquium, Rio de Janeiro, Brazil, July 22--27, 2001.
• Critical probabilities and convergence time of percolation probabilistic cellular automata
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3892344 (Why is no real title available?)
• scientific article; zbMATH DE number 3297706 (Why is no real title available?)
• Stavskaya's measure is weakly Gibbsian

Cited in

(2)

• Variable-length analog of Stavskaya process: a new example of misleading simulation
• A decentralised diagnosis method with probabilistic cellular automata

This page was built for publication: An improved lower bound for the critical parameter of Stavskaya's process

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138967)