Cellular automaton rules conserving the number of active sites

Abstract

This paper shows how to determine all the unidimensional two-state cellular automaton rules of a given number of inputs which conserve the number of active sites. These rules have to satisfy a necessary and sufficient condition. If the active sites are viewed as cells occupied by identical particles, these cellular automaton rules represent evolution operators of systems of identical interacting particles whose total number is conserved. Some of these rules, which allow motion in both directions, mimic ensembles of one-dimensional pseudo-random walkers. Numerical evidence indicates that the corresponding stochastic processes might be non-Gaussian.

14 pages, 5 figures

Cited by in corpus (28)

• A Survey of Cellular Automata: Types, Dynamics, Non-uniformity and Applications
• Number-conserving cellular automaton rules
• Non-deterministic density classification with diffusive probabilistic cellular automata
• Exact results for deterministic cellular automata traffic models
• Conservation Laws in Cellular Automata
• Probabilistic cellular automata with conserved quantities
• Critical behavior of a cellular automaton highway traffic model
• A class of cellular automata equivalent to deterministic particle systems
• Number-conserving cellular automata with a von Neumann neighborhood of range one
• Statistical Mechanics of Surjective Cellular Automata
• Convergence to equilibrium in a class of interacting particle systems evolving in discrete time
• On the existence of a variational principle for deterministic cellular automaton models of highway traffic flow
• Critical behavior of number-conserving cellular automata with nonlinear fundamental diagrams
• Motion representation of one-dimensional cellular automaton rules
• Euler-Lagrange correspondence of generalized Burgers cellular automaton
• Max-plus analysis on some binary particle systems
• Enumeration of number-conserving cellular automata rules with two inputs
• Approximating dynamics of a number-conserving cellular automaton by a finite-dimensional dynamical system
• A hierarchical structure in the motion representation of 2-state number-conserving cellular automata
• Number Conservation via Particle Flow in One-dimensional Cellular Automata
• Universality and Decidability of Number-Conserving Cellular Automata
• Max-min-plus expressions for one-dimensional particle cellular automata obtained from a fundamental diagram
• Structure and dynamics in the low-density phase of a two-dimensional cellular automaton model of traffic flow
• Deterministic cellular automata resembling diffusion
• Eventually Number-Conserving Cellular Automata
• First-passage processes in a deterministic one-dimensional cellular automaton model of traffic flow
• Deterministic Computing Mechanism for Perfect Density Classification
• An order-preserving property of additive invariant for Takesue-type reversible cellular automata