Related papers: Coupling from the past for exponentially ergodic o…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due 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…
We compute the mixing time of the Facilitated Exclusion Process (FEP) and obtain cutoff and pre-cutoff in different regimes. The main tool to obtain this result is a new bijective, deterministic mapping between the joint law of an ergodic…
We study one-dimensional cellular automata evolutions with both temporal and spatial periodicity. The main objective is to investigate the longest temporal periods among all two-neighbor rules, with a fixed spatial period $\sigma$ and…
Recent images of electron flow through a two-dimensional electron gas (2DEG) device show branching behavior that is reproduced in numerical simulations of motion in a correlated random potential [cond-mat/0010348]. We show how such…
We exhibit a Probabilistic Cellular Automaton (PCA) on the integers with an alphabet and a neighborhood of size 2 which is non-ergodic although it has a unique invariant measure. This answers by the negative an old open question on whether…
We show how coupling techniques can be used in some metastable systems to prove that mean metastable exit times are almost constant as functions of the starting microscopic configuration within a "meta-stable set." In the example of the…
The essential features of far-field low-energy defibrillation are elucidated using a simple cellular automaton model of excitable media. The model's topological character allows for direct correspondence with both realistic models and…
We show that the contact process on the rank-one inhomogeneous random graphs and Erdos-R{\'e}nyi graphs with mean degree large enough survives a time exponential in the size of these graphs for any positive infection rate. In addition, a…
A new, conceptual proof approach for establishing the existence of regenerative space-time points for symmetric, translation invariant, finite-range interaction contact processes on survival is shown. The proof is elementary, complements…
We construct a mixing continuous piecewise linear map on [-1,1] with the property that a two-dimensional lattice made of these maps with a linear north and east nearest neighbour coupling admits a phase transition. We also provide a…
We study the optimization of ergodic averages for multi-valued dynamical systems, i.e. where points may have multiple different forward orbits. Under upper semi-continuity assumptions, we show that the maximum space average with respect to…
In programming language semantics, it has proved to be fruitful to analyze context-dependent notions of computation, e.g., dataflow computation and attribute grammars, using comonads. We explore the viability and value of similar modeling…
We started from computer experiments with simple one-dimensional ergodic dynamical systems called interval exchange transformations. Correlators in these systems decay as a power of time. In the simplest non-trivial case the exponent is…
Probabilistic Cellular Automata are extended stochastic systems, widely used for modelling phenomena in many disciplines. The possibility of controlling their behaviour is therefore an important topic. We shall present here an approach to…
Group cellular automata are continuous, shift-commuting endomorphisms of $G^\mathbb{Z}$, where $G$ is a finite group. We provide an easy-to-check characterization of expansivity for group cellular automata on abelian groups and we prove…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
We study cellular automata with randomly selected rules. Our setting are two-neighbor rules with a large number $n$ of states. The main quantity we analyze is the asymptotic probability, as $n \to \infty$, that the random rule has a…
We studied the rule 150 elementary cellular automaton in terms of the distribution of the spacings of the singular values of the matieces obtained from proper time evolutions patterns. The distribution has strong resembrance to that of the…
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…