Related papers: Cellular Automaton Rule184++C. A Simple Model for …
The Biham-Middleton-Levine (BML) traffic model is a simple two-dimensional, discrete Cellular Automaton (CA) that has been used to study self-organization and phase transitions arising in traffic flows. From the computational point of view,…
We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour…
Cyclic cellular automata (CCA) are models of excitable media. Started from random initial conditions, they produce several different kinds of spatial structure, depending on their control parameters. We introduce new tools from information…
A new cellular automaton (CA) traffic model is presented. The focus is on mechanical restrictions of vehicles realized by limited acceleration and deceleration capabilities. These features are incorporated into the model in order to…
Autocatalytic reaction system with a small number of molecules is studied numerically by stochastic particle simulations. A novel state due to fluctuation and discreteness in molecular numbers is found, characterized as extinction of…
We introduce a cellular automaton model coupled with a transport equation for flows on graphs. The direction of the flow is described by a switching process where the switching probability dynamically changes according to the value of the…
A simple relation of the order of $n$ abstract objects generates an $n-2$ dimensional basis of three dimensional vectors. A cellular automaton-like model of evolution of this system is postulated. During this evolution, some quantities…
Measurements on real traffic have revealed the existence of metastable states with very high flow. Such states have not been observed in the Nagel-Schreckenberg (NaSch) model which is the basic cellular automaton for the description of…
A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.
A system of agents moving along a road in both directions is studied numerically within a cellular-automata formulation. An agent steps to the right with probability $q$ or to the left with $1-q$ when encountering other agents. Our model is…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
We study the classification of cellular-automaton update rules into Wolfram's four classes. We start with the notion of the input entropy of a spatiotemporal block in the evolution of a cellular automaton, and build on it by introducing two…
In this paper, we propose the ultra-discrete optimal velocity model, a cellular-automaton model for traffic flow, by applying the ultra-discrete method for the optimal velocity model. The optimal velocity model, defined by a differential…
Cellular automata are a discrete dynamical system which models massively parallel computation. Much attention is devoted to computations with small time complexity for which the parallelism may provide further possibilities. In this paper,…
We propose and discuss two variants of kinetic particle models - cellular automata in 1+1 dimensions, which have some appeal due to their simplicity and intriguing properties which could warrant further research and applications. The first…
In this paper we provide an analytical study of the theory of multi-valued and fuzzy cellular automata where the fuzziness appears as the result of the application of an underlying multi-valued or continuous logic as opposed to standard…
The information flow in a quantum system is a fundamental feature of its dynamics. An important class of dynamics are quantum cellular automata (QCA), systems with discrete updates invariant in time and space, for which an index theory has…
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in…
We study charge fluctuations of a family of stochastic charged cellular automata away from the deterministic single-file limit and obtain the exact typical charge probability distributions, known to be anomalous, using hydrodynamics. The…