Related papers: Exact large deviation statistics and trajectory ph…
A digit function is presented which provides the $i$th-digit in base $p$ of any real number $x$. By means of this function, formulated within $\mathcal{B}$-calculus, the local, nonlocal and global dynamical behaviors of cellular automata…
The large deviations properties of trajectory observables for chaotic non-invertible deterministic maps as studied recently by N. R. Smith, Phys. Rev. E 106, L042202 (2022) and by R. Gutierrez, A. Canella-Ortiz, C. Perez-Espigares,…
This paper proposes an improved cellular automaton traffic flow model based on the brake light model, which takes into account that the desired time gap of vehicles is remarkably larger than one second. Although the hypothetical steady…
A cellular automaton model is presented for random walkers with biologically motivated interactions favoring local alignment and leading to collective motion or swarming behavior. The degree of alignment is controlled by a sensitivity…
We study the dynamical large deviations (LD) of a class of one-dimensional kinetically constrained models whose (tilted) generators can be mapped into themselves via duality transformations. We consider four representative models in detail:…
The quantum cellular automata (QCA) effect is a transition in which multiple electron move coordinately by Coulomb interactions and observed in multiple quantum dots. This effect will be useful for realizing and improving quantum cellular…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
We analyze the macroscopic behavior of multi-populations randomly connected neural networks with interaction delays. Similar to cases occurring in spin glasses, we show that the sequences of empirical measures satisfy a large deviation…
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…
We consider the range of possible dynamics of cellular automata (CA) on two-sided beta-shifts $S_\beta$. We show that any reversible CA $F:S_\beta\to S_\beta$ has an almost equicontinuous direction whenever $S_\beta$ is not sofic. This has…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
An "odd-rule" cellular automaton (CA) is defined by specifying a neighborhood for each cell, with the rule that a cell turns ON if it is in the neighborhood of an odd number of ON cells at the previous generation, and otherwise turns OFF.…
Neural Cellular Automata (NCA) are a powerful combination of machine learning and mechanistic modelling. We train NCA to learn complex dynamics from time series of images and PDE trajectories. Our method is designed to identify underlying…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
Three cellular automaton (CA) models of increasing complexity are introduced to model driven diffusive systems related to the generalized Frenkel-Kontorova (FK) models recently proposed by Braun [Phys.Rev.E58, 1311 (1998)]. The models are…
We consider the problem of metastability for stochastic reversible dynamics with exponentially small transition probabilities. We generalize previous results in several directions. We give an estimate of the spectral gap of the transition…
We investigate the inactive-active phase transition in an array of additive (exclusive-or) cellular automata under noise. The model is closely related with the Domany-Kinzel probabilistic cellular automaton, for which there are rigorous as…
We develop a two-dimensional cellular automaton (CA) as a simple model for agents moving from origins to destinations. Each agent moves towards an empty neighbor site corresponding to the minimal distance to its destination. The…
We numerically study the dynamics of elementary 1D cellular automata (CA), where the binary state $\sigma_i(t) \in \{0,1\}$ of a cell $i$ does not only depend on the states in its local neighborhood at time $t-1$, but also on the memory of…
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…