Related papers: Entry times in automata with simple defect dynamic…
The positive rates conjecture states that a one-dimensional probabilistic cellular automaton (PCA) with strictly positive transition rates must be ergodic. The conjecture has been refuted by G\'acs, whose counterexample is a cellular…
Commonly studied cellular automata are memoryless and have fixed topology of connections between cells. However by allowing updates of links and short-term memory in cells we may potentially discover novel complex regimes of spatio-temporal…
Rule 22 elementary cellular automaton (ECA) has a 3--cell neighborhood, binary cell states, where a cell takes state `1' if there is exactly one neighbor, including the cell itself, in state `1'. In Boolean terms the cell-state transition…
Consider two random walks on $\mathbb{Z}$. The transition probabilities of each walk is dependent on trajectory of the other walker i.e. a drift $p>1/2$ is obtained in a position the other walker visited twice or more. This simple model has…
Pedestrian dynamics exhibits various collective phenomena. Here we study bidirectional pedestrian flow in a floor field cellular automaton model. Under certain conditions, lane formation is observed. Although it has often been studied…
Number-conserving cellular automata are discrete dynamical systems that simulate interacting particles like e.g. grains of sand. In an earlier paper, I had already derived a uniform construction for all transition rules of one-dimensional…
We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
We present a rigorous derivation of the flow at arbitrary time in a deterministic cellular automaton model of traffic flow. The derivation employs regularities in preimages of blocks of zeros, reducing the problem of preimage enumeration to…
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…
We systematically investigate the effect of blockage sites in a cellular automaton model for traffic flow. Different scheduling schemes for the blockage sites are considered. None of them returns a linear relationship between the fraction…
We study discretisation effects in cellular automata models for pedestrian dynamics by reducing the cell size. Then a particle occupies more than one cell which leads to subtle effects in the dynamics, e.g. non-local conflict situations.…
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…
Active Brownian particles (ABPs) are a model for nonequilibrium systems in which the constituent particles are self-propelled in addition to their Brownian motion. Compared to the well-studied mean first passage time (MFPT) of passive…
Discrete dynamical systems can exhibit complex behaviour from the iterative application of straightforward local rules. A famous example are cellular automata whose global dynamics are notoriously challenging to analyze. To address this, we…
Consider a system of particles moving independently as Brownian motions until two of them meet, when the colliding pair annihilates instantly. The construction of such a system of annihilating Brownian motions (aBMs) is straightforward as…
A phenomenological model for a measurement of barrier traversal times for particles is proposed. Two idealized detectors for passage and arrival provide entrance and exit times for the barrier traversal. The averaged traversal time is…
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidable characterization of cellular automata which can be…
We study a discrete time multitype branching random walk on a finite space with finite set of types. Particles follow a Markov chain on the spatial space whereas offspring distributions are given by a random field that is fixed throughout…