Related papers: On computing the Lyapunov exponents of reversible …
We propose a numerical method for computing the Lyapunov exponents of renewal equations (delay equations of Volterra type), consisting first in applying a discrete QR technique to the associated evolution family suitably posed on a Hilbert…
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…
This paper presents new sufficient conditions for convergence and asymptotic or exponential stability of a stochastic discrete-time system, under which the constructed Lyapunov function always decreases in expectation along the system's…
There exist f.g.-universal cellular automata groups which are quotients of $\mathbb{Z} * \mathbb{Z}_2$ or $\mathbb{Z}_2 * \mathbb{Z}_2 * \mathbb{Z}_2$, as previously conjectured by the author.
In this paper the Benettin-Wolf algorithm to determine all Lyapunov exponents for a class of fractional-order systems modeled by Caputo's derivative and the corresponding Matlab code are presented. First it is proved that the considered…
The original local, discrete example of Linear Unitary Cellular Automata (LUCA) is analyzed in terms of a new representation previously introduced in [1] for classical CA. Several important underlying symmetries are reviewed and their tight…
For any group $G$ and any set $A$, a cellular automaton (CA) is a transformation of the configuration space $A^G$ defined via a finite memory set and a local function. Let $\text{CA}(G;A)$ be the monoid of all CA over $A^G$. In this paper,…
Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…
We propose using Probabilistic Cellular Automata (PCA) to address inverse problems with the Bayesian approach. In particular, we use PCA to sample from an approximation of the posterior distribution. The peculiar feature of PCA is their…
Simulating a cellular automaton (CA) for t time-steps into the future requires t^2 serial computation steps or t parallel ones. However, certain CAs based on an Abelian group, such as addition mod 2, are termed ``linear'' because they obey…
In this work, we are interested in the study of the upper Lyapunov exponent $\lambda^+(\theta)$ associated to the periodic family of cocycles defined by $$A_\theta(x):=A(x)R_\theta,\qquad x\in X,$$ where $A\::\: X\to…
In this paper the Benettin-Wolf algorithm to determine all Lyapunov exponents adapted to a class of non-commensurate fractional-order systems modeled by Caputo's derivative and the corresponding Matlab code are presented. The paper…
Chaotic systems have been investigated in the most diverse areas. One of the first steps in chaotic system research is the detection of chaos. The largest Lyapunov exponent (LLE) is one of the most widely used techniques for this purpose.…
For $m$ given square matrices $A_0, A_1, \cdots, A_{m-1}$ ($m\ge 2$), one of which is assumed to be of rank $1$, and for a given sequence $(\omega_n)$ in $\{0,1, \cdots, m-1\}^\mathbb{N}$, the following limit, if it exists,…
Cellular automata (CA) are fully discrete alternatives to partial differential equations (PDE). For PDEs, one often considers the Cauchy problem, or initial value problem: find the solution of the PDE satisfying a given initial condition.…
We consider reversible and surjective cellular automata perturbed with noise. We show that, in the presence of positive additive noise, the cellular automaton forgets all the information regarding its initial configuration exponentially…
We extend a previously introduced semi-analytical representation of a decomposition of CA dynamics in arbitrary dimensions and neighborhood schemes via the use of certain universal maps in which CA rule vectors are derivable from the…
Cellular Automata (CA) theory is a discrete model that represents the state of each of its cells from a finite set of possible values which evolve in time according to a pre-defined set of transition rules. CA have been applied to a number…
In this work we present a theoretical and numerical study of the behaviour of the maximum Lyapunov exponent for a generic coupled-map-lattice in the weak-coupling regime. We explain the observed results by introducing a suitable…
We study non-equilibrium defect accumulation dynamics on a cellular automaton trajectory: a branching walk process in which a defect creates a successor on any neighborhood site whose update it affects. On an infinite lattice, defects…