Dynamic critical properties of a one-dimensional probabilistic cellular automaton

A one-dimensional cellular automaton with a probabilistic evolution rule can generate stochastic surface growth in (1+1) dimensions. Two such discrete models of surface growth are constructed from a probabilistic cellular automaton which is known to show a transition from an active phase to an absorbing phase at a critical probability associated with two particular components of the evolution rule. In one of these models, called Model A in this paper, the surface growth is defined in terms of the evolving front of the cellular automaton on the space-time plane. In the other model, called Model B, surface growth takes place by a solid-on-solid deposition process controlled by the cellular automaton configurations that appear in successive time-steps. Both the models show a depinning transition at the critical point of the generating cellular automaton. In addition, Model B shows a kinetic roughening transition at this point. The characteristics of the surface width in these models are derived by scaling arguments from the critical properties of the generating cellular automaton and by Monte Carlo simulations.

Download Full-text

Erratum to “critical phenomena in a one-dimensional probabilistic cellular automaton” [Physica A 234 (1996) 427–434]

Physica A Statistical Mechanics and its Applications ◽

10.1016/s0378-4371(97)00204-5 ◽

1997 ◽

Vol 242 (1-2) ◽

pp. 316 ◽

Cited By ~ 1

Author(s):

Pratip Bhattacharyya

Keyword(s):

Cellular Automaton ◽

Critical Phenomena ◽

One Dimensional ◽

Probabilistic Cellular Automaton

Download Full-text

Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling

Advances in Applied Probability ◽

10.1017/s0001867800006728 ◽

2013 ◽

Vol 45 (04) ◽

pp. 960-980 ◽

Cited By ~ 9

Author(s):

Ana Bušić ◽

Jean Mairesse ◽

Irène Marcovici

Keyword(s):

Markov Chain ◽

Cellular Automaton ◽

Invariant Measures ◽

Sampling Procedure ◽

Monotonicity Property ◽

Local Rule ◽

Probabilistic Cellular Automata ◽

Perfect Sampling ◽

One Dimensional ◽

Probabilistic Cellular Automaton

A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.

Download Full-text

Probabilistic Cellular Automata, Invariant Measures, and Perfect Sampling

Advances in Applied Probability ◽

10.1239/aap/1386857853 ◽

2013 ◽

Vol 45 (4) ◽

pp. 960-980 ◽

Cited By ~ 2

Author(s):

Ana Bušić ◽

Jean Mairesse ◽

Irène Marcovici

Keyword(s):

Markov Chain ◽

Cellular Automaton ◽

Invariant Measures ◽

Sampling Procedure ◽

Monotonicity Property ◽

Local Rule ◽

Probabilistic Cellular Automata ◽

Perfect Sampling ◽

One Dimensional ◽

Probabilistic Cellular Automaton

A probabilistic cellular automaton (PCA) can be viewed as a Markov chain. The cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. We investigate the ergodicity of this Markov chain. A classical cellular automaton is a particular case of PCA. For a one-dimensional cellular automaton, we prove that ergodicity is equivalent to nilpotency, and is therefore undecidable. We then propose an efficient perfect sampling algorithm for the invariant measure of an ergodic PCA. Our algorithm does not assume any monotonicity property of the local rule. It is based on a bounding process which is shown to also be a PCA. Last, we focus on the PCA majority, whose asymptotic behavior is unknown, and perform numerical experiments using the perfect sampling procedure.

Download Full-text

CRITICAL BEHAVIOR OF A PROBABILISTIC LOCAL AND NONLOCAL SITE-EXCHANGE CELLULAR AUTOMATON

International Journal of Modern Physics C ◽

10.1142/s0129183194000714 ◽

1994 ◽

Vol 05 (03) ◽

pp. 537-545 ◽

Cited By ~ 6

Author(s):

N. BOCCARA ◽

J. NASSER ◽

M. ROGER

Keyword(s):

Cellular Automaton ◽

Critical Behavior ◽

Exchange Process ◽

Mean Field ◽

One Dimensional ◽

Probabilistic Cellular Automaton ◽

Site Exchange ◽

Two Parameters ◽

Automata Network ◽

Dimensional Range

We study the critical behavior of a probabilistic automata network whose local rule consists of two subrules. The first one, applied synchronously, is a probabilistic one-dimensional range-one cellular automaton rule. The second, applied sequentially, exchanges the values of a pair of sites. According to whether the two sites are first-neighbors or not, the exchange is said to be local or nonlocal. The evolution of the system depends upon two parameters, the probability p characterizing the probabilistic cellular automaton, and the degree of mixing m resulting from the exchange process. Depending upon the values of these parameters, the system exhibits a bifurcation similar to a second order phase transition characterized by a nonnegative order parameter, whose role is played by the stationary density of occupied sites. When m is very large, the correlations created by the application of the probabilistic cellular automaton rule are destroyed, and, as expected, the behavior of the system is then correctly predicted by a mean-field-type approximation. According to whether the exchange of the site values is local or nonlocal, the critical behavior is qualitatively different as m varies.

Download Full-text