arXiv Analytics

Sign in

arXiv:2001.11545 [math.PR]AbstractReferencesReviewsResources

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

Alex D. Ramos, Caliteia S. Sousa, Pablo M. Rodriguez, Paula Cadavid

Published 2020-01-30Version 1

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.

Related articles: Most relevant | Search more
arXiv:1003.0334 [math.PR] (Published 2010-03-01)
A lower bound on the critical parameter of interlacement percolation in high dimension
arXiv:1908.10213 [math.PR] (Published 2019-08-27)
Critical Parameters for Loop and Bernoulli Percolation
arXiv:1608.08473 [math.PR] (Published 2016-08-30)
Critical parameter of random loop model on trees