Related papers: Cellular automata, percolation and dynamical dicho…
We discuss how to construct shift-invariant probability measures over the space of bisequences of symbols, and how to describe such measures in terms of block probabilities. We then define cellular automata as maps in the space of measures…
Consider a sequence of i.i.d. random variables $X_n$ where each random variable is refreshed independently according to a Poisson clock. At any fixed time $t$ the law of the sequence is the same as for the sequence at time 0 but at random…
Classical Cellular Automata (CCAs) are a powerful computational framework widely used to model complex systems driven by local interactions. Their simplicity lies in the use of a finite set of states and a uniform local rule, yet this…
The Besicovitch pseudo-metric is a shift-invariant pseudo-metric on the set of infinite sequences, that enjoys interesting properties and is suitable for studying the dynamics of cellular automata. They correspond to the asymptotic behavior…
We show that an almost expansive cellular automaton according to Gilman's classification cannot have irrational eigenvalues. This completes the proof that any surjective cellular automaton cannot have irrational eigenvalues for the uniform…
A cellular automata approach using a Directed Cyclic Graph is used to model interrelationships of fluctuating time, state and space. This model predicts phenomena including a constant and maximum speed at which any moving entity can travel,…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…
We study dynamical systems $(X,G,m)$ with a compact metric space $X$ and a locally compact, $\sigma$-compact, abelian group $G$. We show that such a system has discrete spectrum if and only if a certain space average over the metric is a…
Gauge-invariance is a fundamental concept in physics---known to provide the mathematical justification for all four fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts, directly in…
We prove that the set of subgroups of the automorphism group of a two-sided full shift is closed under countable graph products. We introduce the notion of a group action without $A$-cancellation (for an abelian group $A$), and show that…
In many interacting particle systems, relaxation to equilibrium is thought to occur via the growth of 'droplets', and it is a question of fundamental importance to determine the critical length at which such droplets appear. In this paper…
We present a family of one-dimensional cellular automata modeling the diffusion of an innovation in a population. Starting from simple deterministic rules, we construct models parameterized by the interaction range and exhibiting a…
A ``sandpile'' cellular automaton achieves complex temporal correlations, like a $1/f$ spectrum, if the position where it is perturbed diffuses slowly rather than changing completely at random, showing that the spatial correlations of the…
Our main result is an extension of Pansu's theorem to random metrics, where the edges of the Cayley are i.i.d. random variable with some finite exponential moment. Based on a previous work by the second author, the proof relies on…
After leading to a new axiomatic derivation of quantum theory, the new informational paradigm is entering the domain of quantum field theory, suggesting a quantum automata framework that can be regarded as an extension of quantum field…
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the…
We apply a recently proposed dynamically driven renormalization group scheme to probabilistic cellular automata having one absorbing state. We have found just one unstable fixed point with one relevant direction. In the limit of small…
The density classification task is to determine which of the symbols appearing in an array has the majority. A cellular automaton solving this task is required to converge to a uniform configuration with the majority symbol at each site. It…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…