Related papers: Linear cellular automata, asymptotic randomization…
Let M=Z^D be a D-dimensional lattice, and let A be an abelian group. A^M is then a compact abelian group; a `linear cellular automaton' (LCA) is a topological group endomorphism \Phi:A^M --> A^M that commutes with all shift maps. Suppose…
Let M be a monoid (e.g. the lattice Z^D), and A an abelian group. A^M is then a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. Let mu be a (possibly…
If M is a monoid (e.g. the lattice Z^D), and A is an abelian group, then A^M is a compact abelian group; a linear cellular automaton (LCA) is a continuous endomorphism F:A^M --> A^M that commutes with all shift maps. If F is diffusive, and…
Abelian cellular automata (CA) are CA which are group endomorphisms of the full group shift when endowing the alphabet with an abelian group structure. A CA randomizes an initial probability measure if its iterated images weak *-converge…
We study qualitative properties of two-dimensional freezing cellular automata with a binary state set initialized on a random configuration. If the automaton is also monotone, the setting is equivalent to bootstrap percolation. We explore…
We show that spacetime diagrams of linear cellular automata $\Phi : {\mathbb F}_p^{\mathbb Z} \to {\mathbb F}_p^{\mathbb Z}$ with $(-p)$-automatic initial conditions are automatic. This extends existing results on initial conditions which…
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…
Consider a finite Abelian group (G,+), with |G|=p^r, p a prime number, and F: G^N -> G^N the cellular automaton given by {F(x)}_n= A x_n + B x_{n+1} for any n in N, where A and B are integers relatively primes to p. We prove that if P is a…
In [6], a constraint on invariant measures of bi-permutative cellular automata has been observed: fixed values at the positive indices determine almost-surely a uniform conditional probability on the subset of values of positive conditional…
Let $(\az,F)$ be a bipermutative algebraic cellular automaton. We present conditions which force a probability measure which is invariant for the $\N\times\Z$-action of $F$ and the shift map $\s$ to be the Haar measure on $\gs$, a closed…
This investigation studies the ergodic properties of reversible linear cellular automata over $\mathbb{Z}_m$ for $m \in \mathbb{N}$. We show that a reversible linear cellular automaton is either a Bernoulli automorphism or non-ergodic. This…
If M is a monoid (e.g. the lattice Z^D), and G is a finite (nonabelian) group, then G^M is a compact group; a `multiplicative cellular automaton' (MCA) is a continuous transformation F:G^M-->G^M which commutes with all shift maps, and where…
A new class of automata networks is defined. Their evolution rules are determined by a probability measure p on the set of all integers Z and an indicator function I_A on the interval [0,1]. It is shown that any cellular automaton rule can…
Extending to all probability measures the notion of m-equicontinuous cellular automata introduced for Bernoulli measures by Gilman, we show that the entropy is null if m is an invariant measure and that the sequence of image measures of a…
The asymptotic behavior of a cellular automaton iterated on a random configuration is well described by its limit probability measure(s). In this paper, we characterize measures and sets of measures that can be reached as limit points after…
We add small random perturbations to a cellular automaton and consider the one-parameter family $(F_\epsilon)_{\epsilon>0}$ parameterized by $\epsilon$ where $\epsilon>0$ is the level of noise. The objective of the article is to study the…
We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…
We consider a probabilistic cellular automaton to analyze the stochastic dynamics of a predator-prey system. The local rules are Markovian and are based in the Lotka-Volterra model. The individuals of each species reside on the sites of a…
Suppose R is a finite commutative ring of prime characteristic, A is a finite R-module, M:=Z^D x N^E, and F is an R-linear cellular automaton on A^M. If mu is an F-invariant measure which is multiply shift-mixing in a certain way, then we…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…