Cellular Automata and Lattice Gases
The essential distinction between the fundamental diagram approach and three-phase theory is the existence of the unique space-gap-speed relationship. In order to verify this relationship, empirical data are analyzed with the following…
The misanthrope process is a class of stochastic interacting particle systems, generalizing the simple exclusion process. It allows each site of the lattice to accommodate more than one particle. We consider a special case of the one…
The purpose of the present study is to search one-dimensional Cellular Automata (CA) rules which will solve the density classification task (DCT) perfectly. The mathematical analysis of number conserving functions over binary strings of…
This paper describes a new concept of cellular automaton (CA). XCA consists of a set of arcs (edges) that correspond to cells in CA. At a particular time, the arcs are connected to a directed graph. With each time step, the arcs exchange…
One of the simplest multilevel cellular automata - the hodgepodge machine - was modified to best match the chemical trajectory observed in the Belousov-Zhabotinsky reaction. Noise introduces watersheding of the central regular pattern into…
A general mathematical method is presented for the systematic construction of coupled map lattices (CMLs) out of deterministic cellular automata (CAs). The entire CA rule space is addressed by means of a universal map for CAs that we have…
We examine the Nagel-Schreckenberg traffic model for a variety of maximum speeds. We show that the low density limit can be described as a dilute gas of vehicles with a repulsive core. At the transition to jamming, we observe finite-size…
The complexity of human behaviour can lead to very unpredictable patterns in social activity and structure. Here we demonstrate the instability of a community network controlled by majority ruling, where an element adopts the most popular…
The classical game of rock-paper-scissors have inspired experiments and spatial model systems that address robustness of biological diversity. In particular the game nicely illustrates that cyclic interactions allow multiple strategies to…
The density classification problem is the computational problem of finding the majority in a given array of votes in a distributed fashion. It is known that no cellular automaton rule with binary alphabet can solve the density…
The statistics of velocities in the cellular automaton model of Nagel and Schreckenberg for traffic are studied. From numerical simulations, we obtain the probability distribution function (PDF) for vehicle velocities and the…
Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a…
The density classification problem is one of the simplest yet non-trivial computing tasks which seem to be ideally suitable for cellular automata (CA). Unfortunately, there exists no one-dimensional two-state CA which classifies binary…
We study the motion of pedestrians through an obscure tunnel where the lack of visibility hides the exits. Using a lattice model, we explore the effects of communication on the effective transport properties of the crowd of pedestrians.…
Mesoscopic dynamics of self-organized structures is the most important aspect in the description of complex living systems. The Belousov--Zhabotinsky (B--Z) reaction is in this respect a convenient testbed because it represents a prototype…
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…
We present a method for construction of approximate orbits of measures under the action of cellular automata which is complementary to the local structure theory. The local structure theory is based on the idea of Bayesian extension, that…
Bottlenecks, i.e. local reductions of capacity, are one of the most relevant scenarios of traffic systems. The asymmetric simple exclusion process (ASEP) with a defect is a minimal model for such a bottleneck scenario. One crucial question…
Cellular automata (CA) have long attracted attention as dynamical systems with local updating rules and yet can exhibit, for certain rules, complex, long space and time correlated patterns. This contrast with other rules which results in…
The target of our study is to approximate numerically and, in some particular physically relevant cases, also analytically, the residence time of particles undergoing an asymmetric simple exclusion dynamics on a stripe. The source of…