Related papers: Phase Transitions of Cellular Automata
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…
A cellular automaton model is presented for random walkers with biologically motivated interactions favoring local alignment and leading to collective motion or swarming behavior. The degree of alignment is controlled by a sensitivity…
An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes,…
We discuss various properties of Probabilistic Cellular Automata, such as the structure of the set of stationary measures and multiplicity of stationary measures (or phase transition) for reversible models.
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
We introduce a stochastic cellular automaton with power law spatial decaying long-range interactions. In some limit this model reduces to the Domany-Kinzel cellular automaton. Monte Carlo and mean field calculations of the phase diagram of…
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing…
A general stochastic traffic cellular automaton (CA) model, which includes slow-to-start effect and driver's perspective, is proposed in this paper. It is shown that this model includes well known traffic CA models such as…
We study phase transitions in a long-range one-dimensional cellular automaton with two symmetric absorbing states. It includes and extends several other models, like the Ising and Domany-Kinzel ones. It is characterized by a competing…
We study the damage spreading transition in a generic one-dimensional stochastic cellular automata with two inputs (Domany-Kinzel model) Using an original formalism for the description of the microscopic dynamics of the model, we are able…
We investigate the percolation properties of a two-state (occupied - empty) cellular automaton, where at each time step a cluster of occupied sites is removed and the same number of randomly chosen empty sites are occupied again. We find a…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
We show that cellular automata can classify data by inducing a form of dynamical phase coexistence. We use Monte Carlo methods to search for general two-dimensional deterministic automata that classify images on the basis of activity, the…
To provide a more accurate description of the driving behaviors in vehicle queues, a namely Markov-Gap cellular automata model is proposed in this paper. It views the variation of the gap between two consequent vehicles as a Markov process…
Probabilistic Cellular Automata (PCA) are simple models used to study dynamical phase transitions. There exist mean field approximations to PCA that can be shown to exhibit a phase transition. We introduce a model interpolating between a…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…
Discretizing spacetime is often a natural step towards modelling physical systems. For quantum systems, if we also demand a strict bound on the speed of information propagation, we get quantum cellular automata (QCAs). These originally…
Discrete dynamical systems can exhibit complex behaviour from the iterative application of straightforward local rules. A famous example are cellular automata whose global dynamics are notoriously challenging to analyze. To address this, we…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…