Related papers: Symmetry pattern transition in cellular automata w…
This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results…
Motivated by modeling the dynamics of a population living in a flowing medium where the environmental factors are random in space, we have studied an asymmetric variant of the one-dimensional contact process, where the quenched random…
For networks of pulse-coupled oscillators with complex connectivity, we demonstrate that in the presence of coupling heterogeneity precisely timed periodic firing patterns replace the state of global synchrony that exists in homogenous…
Cellular automata represent physical systems where both space and time are discrete, and the associated physical quantities assume a limited set of values. While previous research has applied cellular automata in modeling chemical,…
We consider a probabilistic cellular automaton to analyze the stochastic dynamics of a predator-prey system. The local rules are Markovian and are based in the Lotka-Volterra model. The individuals of each species reside on the sites of a…
A cellular automata model that describes as limit cases of his parameters the spread of contagious diseases modeled by systems of ordinary or partial differential equations is developed. Periodic features of the behavior of human settlement…
We study non-equilibrium defect accumulation dynamics on a cellular automaton trajectory: a branching walk process in which a defect creates a successor on any neighborhood site whose update it affects. On an infinite lattice, defects…
We study a process of pattern formation for a generic model of species anchored to the nodes of a network where local reactions take place, and that experience non-reciprocal long-range interactions, encoded by the network directed links.…
We study the collective behaviour of an ensemble of coupled motile elements whose interactions depend on time and are alternatively attractive or repulsive. The evolution of interactions is driven by individual internal variables with…
We redefine the transition function of elementary cellular automata (ECA) in terms of discrete operators. The operator representation provides a clear hint about the way systems behave both at the local and the global scale. We show that…
The traffic-like collective movement of ants on a trail can be described by a stochastic cellular automaton model. We have earlier investigated its unusual flow-density relation by using various mean field approximations and computer…
We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…
A deterministic cellular automaton rule defined on the Moore neighbourhood is studied as a model of epidemic propagation. The directed nature of the interaction between cells allows one to introduce the dependence on a disorder parameter…
This paper designs an efficient two-class pattern classifier utilizing asynchronous cellular automata (ACAs). The two-state three-neighborhood one-dimensional ACAs that converge to fixed points from arbitrary seeds are used here for pattern…
Cellular automata can show well known features of quantum mechanics, such as a linear updating rule that resembles a discretized form of the Schr\"odinger equation together with its conservation laws. Surprisingly, a whole class of…
We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing…
We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
We consider the pattern formation problem in coupled identical systems after the global synchronized state becomes unstable. Based on analytical results relating the coupling strengths and the instability of each spatial mode (pattern) we…
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…