Related papers: On computing the Lyapunov exponents of reversible …
We study the synchronization of totalistic one dimensional cellular automata (CA). The CA with a non zero synchronization threshold exhibit complex non periodic space time patterns and conversely. This synchronization transition is related…
In line with the stability theory of continuous dynamical systems, Lyapunov exponents of cellular automata (CAs) have been conceived two decades ago to quantify to what extent their dynamics changes following a perturbation of their initial…
In this article we give a new definition of some analog of Lyapunov exponents for cellular automata . Then for a shift ergodic and cellular automaton invariant probability measure we establish an inequality between the entropy of the…
Cellular automata (CA) have been found as an attractive modeling tool for various applications, such as, pattern recognition, image processing, data compression, encryption, and specially for VLSI design & test. For such applications,…
In this paper, we study reversibility of one-dimensional(1D) linear cellular automata(LCA) under null boundary condition, whose core problems have been divided into two main parts: calculating the period of reversibility and verifying the…
For a d-dimensional cellular automaton with d $\ge$ 1 we introduce a rescaled entropy which estimates the growth rate of the entropy at small scales by generalizing previous approaches [1, 9]. We also define a notion of Lyapunov exponent…
The cellular automaton is a widely known model of both reversible and irreversible computations. The family of reversible second-order cellular automata considered in this work is appropriate both for construction of logic gates and…
In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field $\mathbb F_p$ (the set of prime numbers modulo $p$). We construct the rule matrix corresponding to finite cellular automata on Cayley tree.…
The exact value of the Lyapunov exponents for the random matrix product $P_N = A_N A_{N-1}...A_1$ with each $A_i = \Sigma^{1/2} G_i^{\rm c}$, where $\Sigma$ is a fixed $d \times d$ positive definite matrix and $G_i^{\rm c}$ a $d \times d$…
We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be…
In this dissertation, we study two of the global properties of 1-dimensional cellular automata (CAs) under periodic boundary condition, namely, reversibility and randomness. To address reversibility of finite CAs, we develop a mathematical…
In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality $p^k$, i.e. the maps $T_{f[l,r]}:\mathbb{Z}^{\mathbb{Z}}_{p^k}\to\mathbb{Z}^{\mathbb{Z}}_{p^k}$ which…
We show that linear analytic cocycles where all Lyapunov exponents are negative infinite are nilpotent. For such one-frequency cocycles we show that they can be analytically conjugated to an upper triangular cocycle or a Jordan normal form.…
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…
In this work, we give a rigorous explicit formula for the Lyapunov exponent for some binary infinite products of random $2\times 2$ real matrices. All these products are constructed using only two types of matrices, $A$ and $B$, which are…
Lyapunov exponents can be difficult to determine from experimental data. In particular, when using embedding theory to build chaotic attractors in a reconstruction space, extra "spurious" Lyapunov exponents arise that are not Lyapunov…
We study the phenomenon of lack of reversibility in molecular dynamics algorithms for the case of Wilson's lattice QCD. We demonstrate that the classical equations of motion that are employed in these algorithms are chaotic in nature. The…
We explicitly compute the maximal Lyapunov exponent for a switched system on $\mathrm{SL}_2(\mathbb R)$. This computation is reduced to the characterization of optimal trajectories for an optimal control problem on the Lie group.
We concern with a special class of binary cellular automata, i.e., the so-called particle cellular automata (PCA) in the present paper. We first propose max-plus expressions to PCA of 4 neighbors. Then, by utilizing basic operations of the…
We introduce a new approach to evaluate the largest Lyapunov exponent of a family of nonnegative matrices. The method is based on using special positive homogeneous functionals on $R^{d}_+,$ which gives iterative lower and upper bounds for…