Related papers: Entry times in automata with simple defect dynamic…
Probabilistic cellular automata provide a simple framework for the exploration of classical nonequilibrium processes. Recently, quantum cellular automata have been proposed that rely on the propagation of a one-dimensional quantum state…
Here I describe a view of the evolution of cellular automata that allows to operate on larger structures. Instead of calculating the next state of all cells in one step, the method here developed uses a time slice that can proceed at…
The phase diagram of the coupled sine circle map lattice shows spatio-temporal intermittency of two distinct types: spatio-temporal intermittency of the directed percolation (DP) class, and spatial intermittency which does not belong to…
A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…
How long a stochastic process survives before leaving a domain depends not only on its intrinsic dynamics but also on how it is observed. Classical first-passage theory assumes continuous monitoring with absorbing boundaries…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
Simple cellular automata models are able to reproduce the basic properties of highway traffic. The comparison with empirical data for microscopic quantities requires a more detailed description of the elementary dynamics. Based on existing…
We consider an interacting particle system on the one dimensional lattice $\bf Z$ modeling combustion. The process depends on two integer parameters $2\le a<M<\infty$. Particles move independently as continuous time simple symmetric random…
We introduce density dependence of the cell size in cellular-automaton models for traffic flow, which allows a more precise correspondence between real-world phenomena and what observed in simulation. Also, we give an explicit calibration…
Cellular networks are often composed of thin tubules connecting much larger node compartments. These structures serve for active or diffusion transport of proteins. Examples are glial networks in the brain, the endoplasmic reticulum in…
We study the random walk of a particle in a compartmentalized environment, as realized in biological samples or solid state compounds. Each compartment is characterized by its length $L$ and the boundaries transmittance $T$. We identify two…
We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a different perspective, that is, we consider a dynamic…
We discuss an autonomous motor based on a Brownian particle driven from thermal equilibrium by periodic in time variation of the internal potential through which the particle interacts with molecules of the surrounding thermal bath. We…
Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…
We show that cellular automata can classify data by inducing a form of dynamical phase coexistence. We use Monte Carlo methods to search for general two-dimensional deterministic automata that classify images on the basis of activity, the…
Red and blue particles are placed in equal proportion through-out either the complete or star graph and iteratively sampled to take simple random walk steps. Mutual annihilation occurs when particles with different colors meet. We compare…
We study a simple one-dimensional model of ballisticaly-controlled annihilation in which the two annihilating species are initially spatially separated. The time dependent properties of the annihilation front are exactly derived. It is…
We introduce a formalism for the calculation of the time of arrival t at a detector of particles traveling through interacting environments. We develop a general formulation that employs quantum canonical transformations from the free to…
In this paper I present a first attempt for a possible description of fluids dynamics by mean of a cellular automata technique. With the use of simple and elementary rules, based on random behaviour either, the model permits to obtain the…
We study the problem of distributed traffic control in the partitioned plane, where the movement of all entities (robots, vehicles, etc.) within each partition (cell) is coupled. Establishing liveness in such systems is challenging, but…