Image credit: Flickr

Convergence Time and Phase Transition in a Non-monotonic Family of Probabilistic Cellular Automata

Image credit: Flickr

Convergence Time and Phase Transition in a Non-monotonic Family of Probabilistic Cellular Automata

Abstract

In dynamical systems, some of the most important questions are related to phase transitions and convergence time. We consider a one-dimensional probabilistic cellular automaton where their components assume two possible states, zero and one, and interact with their two nearest neighbors at each time step. Under the local interaction, if the component is in the same state as its two neighbors, it does not change its state. In the other cases, a component in state zero turns into a one with probability α, and a component in state one turns into a zero with probability 1−β. For certain values of α and β, we show that the process will always converge weakly to δ0, the measure concentrated on the configuration where all the components are zeros. Moreover, the mean time of this convergence is finite, and we describe an upper bound in this case, which is a linear function of the initial distribution. We also demonstrate an application of our results to the percolation PCA. Finally, we use mean-field approximation and Monte Carlo simulations to show coexistence of three distinct behaviours for some values of parameters α and β.

Publication
In Journal of Statistical Physics.
Next
Previous