Related papers: Stochastic cellular automaton for the coagulation-…
Cellular automata and other discrete dynamical systems have long been studied as models of emergent complexity. Recently, neural cellular automata have been proposed as models to investigate the emerge of a more general artificial…
In this paper, a diffusion-aggregation equation with delta potential is introduced. Based on the global existence and uniform estimates of solutions to the diffusion-aggregation equation, we also provide the rigorous derivation from a…
We study the spreading of damage in the one-dimensional Ising model by means of the stochastic dynamics resulting from coupling the system and its replica by a family of algorithms that interpolate between the heat bath and the…
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,…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
The restricted diffusive pair contact process 2A->3A, 2A->0 (PCPD) and the classification of its critical behavior continues to be a challenging open problem of non-equilibrium statistical mechanics. Recently Kockelkoren and Chate [Phys.…
The cellular automaton (CA) pulsing model (arXiv:1806.06416) described the surprising phenomenon of spontaneous, sustained and robust rhythmic oscillations, pulsing dynamics, when random wiring is applied to a 2D `glider' rule running in a…
We use a boolean cellular automaton model to describe the diffusion limited dynamics of the irreversible reaction A+A->A+S on a 1D lattice. We derive a set of equations for the dynamics of the empty interval probabilities from which…
The advantage of Cellular Potts Model (CPM) is due to its ability for introducing cell-cell interaction based on the well known statistical model i.e. the Potts model. On the other hand, Lattice gas Cellular Automata (LGCA) can simulate…
We show how to construct a deterministic nearest-neighbour cellular automaton (CA) with four states which emulates diffusion on a one-dimensional lattice. The pseudo-random numbers needed for directing random walkers in the diffusion…
Cellular automata are widely used to model real-world dynamics. We show using the Domany-Kinzel probabilistic cellular automata that alternating two supercritical dynamics can result in subcritical dynamics in which the population dies out.…
The pair-contact process 2A->3A, 2A->0 with diffusion of individual particles is a simple branching-annihilation processes which exhibits a phase transition from an active into an absorbing phase with an unusual type of critical behaviour…
We study a two-dimensional cellular automaton (CA), called Diffusion Rule (DR), which exhibits diffusion-like dynamics of propagating patterns. In computational experiments we discover a wide range of mobile and stationary localizations…
We derive a set of algorithms for simulating the diffusion-limited growth of faceted crystals using local cellular automata. This technique has been shown to work well in reproducing realistic crystal morphologies, and the present work…
We analyze two alternative methods for determining the exponent $z$ of the contact process (CP) and Domany-Kinzel (DK) cellular automaton in Monte Carlo Simulations. One method employs mixed initial conditions, as proposed for magnetic…
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…
There are few known universality classes of absorbing phase transitions in one dimension and most models fall in the well-known directed percolation (DP) class. Synchronization is a transition to an absorbing state and this transition is…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
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…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…