Cellular Automata and Lattice Gases
Bidirectional transport in (quasi) one-dimensional systems generically leads to cluster-formation and small particle currents. This kind of transport can be described by the asymmetric simple exclusion process (ASEP) with two species of…
Emergence, the phenomena where a system's micro-scale dynamics facilitate the development of non-trivial, informative higher scales, has become a foundational concept in modern sciences, tying together fields as diverse as physics, biology,…
We study a cellular automaton (CA) model of information dynamics on a single hypha of a fungal mycelium. Such a filament is divided in compartments (here also called cells) by septa. These septa are invaginations of the cell wall and their…
Cellular automata (CA) are fully discrete alternatives to partial differential equations (PDE). For PDEs, one often considers the Cauchy problem, or initial value problem: find the solution of the PDE satisfying a given initial condition.…
Cellular automata (CA) can be viewed as maps in the space of probability measures. Such maps are normally infinitely-dimensional, and in order to facilitate investigations of their properties, especially in the context of applications,…
An exact characterization of the different dynamical behavior that exhibit the space phase of a reversible and conservative cellular automaton, the so called Q2R model, is shown in this paper. Q2R is a cellular automaton which is a…
Human crowds base most of their behavioral decisions upon anticipated states of their walking environment. We explore a minimal version of a lattice model to study lanes formation in pedestrian counterflow. Using the concept of horizon…
This paper proposes a method of auto-generation of a centerline graph from a geometrically complex roadmap of real-world traffic systems by using a hierarchical quadtree for cellular automata simulations. Our method is summarized as…
This paper introduces a general model of a single-lane roundabout, represented as a circular lattice that consists of $L$ cells, with Markovian traffic dynamics. Vehicles enter the roundabout via on-ramp queues that have stochastic arrival…
This paper presents a new class of one-dimensional (1D) traffic models with look-ahead rules that take into account of two effects: nonlocal slow-down effect and right-skewed non-concave asymmetry in the fundamental diagram. The proposed 1D…
This work explores the potential of elementary cellular automata to model the dynamics of riot. Here, to model such dynamics, we introduce probabilistic loss of information and delay perturbation in the updating scheme of automata to…
Deep learning techniques have recently demonstrated broad success in predicting complex dynamical systems ranging from turbulence to human speech, motivating broader questions about how neural networks encode and represent dynamical rules.…
Voice disorders affect patients profoundly, and acoustic tools can potentially measure voice function objectively. Nonetheless, existing tools are limited to analysing voices displaying near periodicity, and do not account for inherent…
A one-dimensional two-state number-conserving cellular automaton (NCCA) is a cellular automaton whose states are 0 or 1 and where cells take states 0 and 1 and updated their states by the rule which keeps overall sum of states constant. It…
Smooth transportation has drawn the attention of many researchers and practitioners in several fields. In the present paper, we propose a modified model of a totally asymmetric simple exclusion process (TASEP), which includes multiple…
We propose a max-plus equation which includes Conway's Game of Life (GoL) as a special case. There are some special solutions to the equation which include and unify those to GoL. Moreover, the multi-value extension of GoL is derived from…
We continue the study of asynchrony immunity in cellular automata (CA), which can be considered as a weaker version of correlation immunity in the context of vectorial Boolean functions. The property could have applications as a…
The density classification task is a famous problem in the theory of cellular automata. It is unsolvable for deterministic automata, but recently solutions for stochastic cellular automata have been found. One of them is a set of stochastic…
This is a study of localised structures in one-dimensional cellular automata, with the elementary cellular automaton Rule 54 as a guiding example. A formalism for particles on a periodic background is derived, applicable to all…
Universality in cellular automata theory is a central problem studied and developed from their origins by John von Neumann. In this paper, we present an algorithm where any Turing machine can be converted to one-dimensional cellular…