Related papers: Cellular automata and Lyapunov exponents
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…
In this paper we consider cellular automata $(\mathfrak{G},\Phi)$ with algebraic local rules and such that $\mathfrak{G}$ is a topological Markov chain which has a structure compatible to this local rule. We characterize such cellular…
In this paper we study the notion of estimation entropy recently established by Liberzon and Mitra. This quantity measures the smallest rate of information about the state of a dynamical system above which an exponential state estimation…
We define the notion of stochastic stability, already present in the literature in the context of smooth dynamical systems, for invariant measures of cellular automata perturbed by a random noise, and the notion of strongly stochastically…
Ergodic properties of rational maps are studied, generalising the work of F.\ Ledrappier. A new construction allows for simpler proofs of stronger results. Very general conformal measures are considered. Equivalent conditions are given for…
The Lyapunov exponent corresponding to a set of square matrices $\mathcal{A} = \{A_1, \dots, A_n \}$ and a probability distribution $p$ over $\{1, \dots, n\}$ is $\lambda(\mathcal{A},p) := \lim_{k \to \infty} \frac{1}{k} \,\mathbb{E} \log…
The paper proposes a simple formalism for dealing with deterministic, non-deterministic and stochastic cellular automata in a unifying and composable manner. Armed with this formalism, we extend the notion of intrinsic simulation between…
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…
The Lyapunov exponents of a chaotic system quantify the exponential divergence of initially nearby trajectories. For Hamiltonian systems the exponents are related to the eigenvalues of a symplectic matrix. We make use of this fact to…
If A=Z/2, then A^Z is a compact abelian group. A `linear cellular automaton' is a shift-commuting endomorphism F of A^Z. If P is a probability measure on A^Z, then F `asymptotically randomizes' P if F^j P converges to the Haar measure as…
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…
Lyapunov exponents are indicators for the chaotic properties of a classical dynamical system. They are most naturally defined in terms of the time evolution of a set of so-called covariant vectors, co-moving with the linearized flow in…
The main goal of this work is to establish an asymptotic form of Bressan's mixing conjecture. To this end, we develop an ergodic-theoretic framework for incompressible DiPerna-Lions flows. Lyapunov exponents are defined via an…
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…
In this paper, we improve the known estimates for the invariance entropy of a nonlinear control system. For sets of complete approximate controllability we derive an upper bound in terms of Lyapunov exponents and for uniformly hyperbolic…
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…
We construct an invariant measure for a piecewise analytic interval map whose Lyapunov exponent is not defined. Moreover, for a set of full measure, the pointwise Lyapunov exponent is not defined. This map has a Lorenz-like singularity and…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from…
In this paper we study the dynamics of 1- and 2- dimensional cellular automata, using a 2-adic representation of the states, we give a simple graphical technique for finding periodic solutions. We also study the continuity properties of the…