相关论文: Cellular automata and Lyapunov exponents

The dependence of the Lyapunov exponent on the closeness parameter, $\epsilon$, in tangent bifurcation systems is investigated. We study and illustrate two averaging procedures for defining Lyapunov exponents in such systems. First, we…

We give new sufficient ergodicity conditions for two-state probabilistic cellular automata (PCA) of any dimension and any radius. The proof of this result is based on an extended version of the duality concept. Under these assumptions, in…

We introduce a new class of probabilistic cellular automata that are capable of exhibiting rich dynamics such as synchronization and ergodicity and can be easily inferred from data. The system is a finite-state locally interacting Markov…

We investigate topological and ergodic properties of cellular automata having equicontinuity points. In this class surjectivity on a transitive SFT implies existence of a dense set of periodic points. Our main result is that under the…

We discuss various properties of Probabilistic Cellular Automata, such as the structure of the set of stationary measures and multiplicity of stationary measures (or phase transition) for reversible models.

While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first discuss a few possibilities and then investigate what we call…

We construct a continuous linear cocycle over an expanding base dynamics for which the Lyapunov exponents of all ergodic invariant probability measures are small, except for one measure whose Lyapunov exponents are away from zero. The…

We will consider a family of cellular automata $\Phi: \{1,2,...,r\}^\mathbb{N}\circlearrowright$ that are not of algebraic type. Our first goal is to determine conditions that result in the identification of probabilities that are at the…

This paper is concerned with relationships of Lyapunov exponents with sensitivity and stability for non-autonomous discrete systems. Some new concepts are introduced for non-autonomous discrete systems, including Lyapunov exponents, strong…

We show that a cellular automaton (or shift-endomorphism) on a transitive subshift is either almost equicontinuous or sensitive. On the other hand, we construct a cellular automaton on a full-shift (hence a transitive subshift) that is…

Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…

We prove that, for semi-invertible linear cocycles, Lyapunov exponents of ergodic measures may be approximated by Lyapunov exponents on periodic points.

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…

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…

In this paper, we investigate some ergodic properties of $Z^{2}$-actions $T_{p,n}$ generated by an additive cellular automata and shift acting on the space of all doubly -infinitive sequences taking values in $Z_{m}$.

Ergodic parameters like the Lyapunov and the conditional exponents are global functions of the invariant measure, but the invariant measure itself contains more information. A more complete characterization of the dynamics by new families…

Lyapunov exponents describe the asymptotic behavior of the singular values of large products of random matrices. A direct computation of these exponents is however often infeasible. By establishing a link between Lyapunov exponents and an…

Revisiting the notion of m-almost equicontinuous cellular automata introduced by R. Gilman, we show that the sequence of image measures of a shift ergodic measure m by iterations of a m-almost equicontinuous automata F, converges in Cesaro…

We study the classification of cellular-automaton update rules into Wolfram's four classes. We start with the notion of the input entropy of a spatiotemporal block in the evolution of a cellular automaton, and build on it by introducing two…

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…