Cellular Automata and Lattice Gases
The search for symmetry as an unusual yet profoundly appealing phenomenon, and the origin of regular, repeating configuration patterns have long been a central focus of complexity science and physics. To better grasp and understand symmetry…
The two-state Gacs-Kurdyumov-Levin (GKL) cellular automaton has been a staple model in the study of complex systems due to its ability to classify binary arrays of symbols according to their initial density. We show that a class of modified…
While there has been a keen interest in studying computation at the edge of chaos for dynamical systems undergoing a phase transition, this has come under question for cellular automata. We show that for continuously deformed cellular…
A bottleneck can largely deteriorate the flow, such as a traffic light or an on-ramp at a road. To alleviate bottleneck situations, one of the important strategies is to control the input rate to suit the state of the road. In this study,…
To investigate the evacuation behaviors of pedestrians considering action of the guard and develop an effective evacuation strategy in the artificial attack, an extended floor field model was proposed. In this model, the assault on…
In this article we study a class of shift-invariant and positive rate probabilistic cellular automata (PCA) on rooted d-regular trees $\mathbb{T}^d$. In a first result we extend the results of [10] on trees, namely we prove that to every…
We study the chaos of travelling waves (TW) in unidirectional chains of bistable maps. Previous numerical results suggested that this property is selective, {\sl viz.}\ given the parameters, there is at most a single (non-trivial) velocity…
This paper proposes a totally asymmetric simple exclusion process on a traveling lane, which is equipped with a queueing system and functions of site assignments along the parking lane. In the proposed system, new particles arrive at the…
Cellular automaton (CA) approach is an important theoretical framework for studying complex system behavior and has been widely applied in various research field. CA traffic flow models have the advantage of flexible evolution rules and…
We present an agent-based model to simulate gang territorial development motivated by graffiti marking on a two-dimensional discrete lattice. For simplicity, we assume that there are two rival gangs present, and they compete for territory.…
A modified version of Langton's ant is considered. The modified automaton is allowed to go straight $N$-th step instead of turning. The cell state, however, is changed as usually. Depending on the value of $N$ the automaton exhibits…
In this paper we perform numerical simulations to study Kauffman cellular automata (KCA) on quasiperiod lattices. In particular, we investigate phase transition, magnetic entropy and propagation speed of the damage on these lattices. Both…
Time reversal of waves has been successfully used in communications, sensing and imaging for decades. The application in underwater acoustic communications is of our special interest, as it puts together a reversible process (allowing a…
We explore the emergence of persistent infection in a closed region where the disease progression of the individuals is given by the SIRS model, with an individual becoming infected on contact with another infected individual within a given…
We introduce our GraftalLace Cellular Automaton in short GLCA which is a new one-dimensional cellular automaton on the regular square lattice. It makes a monochromatic infinite directed graph otherwise an octal number triangle or number…
This study proposes a model of a totally asymmetric simple exclusion process on a single channel lane with functions of site-assignments along the pitlane. The system model attempts to insert a new particle to the leftmost site at a certain…
Without loss of generalisation to other systems, including possibly non-deterministic ones, we demonstrate the application of methods drawn from algorithmic information dynamics to the characterisation and classification of emergent and…
We study the asymptotic behaviour of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing…
In this article, I propose a systematic method for the inverse ultra-discretization of cell automata using a functionally complete operation. We derive difference equations for the 256 kinds of elementary cellular automata(ECA) introduced…
We present a diagrammatic method to build up sophisticated cellular automata (CAs) as models of complex physical systems. The diagrams complement the mathematical approach to CA modeling, whose details are also presented here, and allow CAs…