Related papers: Introducing Lyapunov profiles of cellular automata
Discretizing spacetime is often a natural step towards modelling physical systems. For quantum systems, if we also demand a strict bound on the speed of information propagation, we get quantum cellular automata (QCAs). These originally…
A new stochastic cellular automaton (CA) model of traffic flow, which includes slow-to-start effects and a driver's perspective, is proposed by extending the Burgers CA and the Nagel-Schreckenberg CA model. The flow-density relation of this…
It is shown that the asymptotic spectra of finite-time Lyapunov exponents of a variety of fully chaotic dynamical systems can be understood in terms of a statistical analysis. Using random matrix theory we derive numerical and in particular…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
We consider a mechanism for area preserving Hamiltonian systems which leads to the enhanced probability, $P(\lambda, t)$, to find small values of the finite time Lyapunov exponent, $\lambda$. In our investigation of chaotic dynamical…
Graphical continuous Lyapunov models offer a new perspective on modeling causally interpretable dependence structure in multivariate data by treating each independent observation as a one-time cross-sectional snapshot of a temporal process.…
For a fast particle moving within a two-dimensional array of soft scatterers - centers of weak and short-range potential - the dependence of the Lyapunov exponent on the system parameters is studied. The use of the linearized equations for…
This article surveys some theoretical aspects of Cellular Automata (CAs) research. In particular, we discuss on maximal length CA. An n-cell CA is a maximal length CA, if all the configurations except one form a single cycle. There is a…
Cellular Automata (CA), as they are presented in the literature, are abstract mathematical models of computation. In this pa- per we present an alternate approach: using the CA as a model or theory of physical systems and devices. While…
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…
In this paper, we explore relationships between two models of systems which are governed by only the local interactions of large collections of simple components: cellular automata (CA) and the abstract Tile Assembly Model (aTAM). While…
We study the Lyapunov instability of a two-dimensional fluid composed of rigid diatomic molecules, with two interaction sites each, and interacting with a WCA site-site potential. We compute full spectra of Lyapunov exponents for such a…
The Lyapunov exponent characterizes an exponential growth rate of the difference of nearby orbits. A positive Lyapunov exponent is a manifestation of chaos. Here, we propose the Lyapunov pair, which is based on the generalized Lyapunov…
The Lyapunov exponent is well-known in deterministic dynamical systems as a measure for quantifying chaos and detecting coherent regions in physically evolving systems. In this Letter, we show how the Lyapunov exponent can be unified with…
We show, using generic globally-coupled systems, that the collective dynamics of large chaotic systems is encoded in their Lyapunov spectra: most modes are typically localized on a few degrees of freedom, but some are delocalized, acting…
Modeling the immune system so that its essential functionalities stand out without the need for every molecular or cellular interaction to be taken into account has been challenging for many decades. Two competing approaches have been the…
The predictability problem for systems with different characteristic time scales is investigated. It is shown that even in simple chaotic dynamical systems, the leading Lyapunov exponent is not sufficient to estimate the predictability…
This study introduces Skewed Fully Asynchronous Cellular Automata (SACA), a novel update scheme in cellular automata that updates the states of only two consecutive and adjacent cells, such as ci and ci+1, simultaneously at each time step.…
Cellular automata are capable of developing complex behaviors based on simple local interactions between their elements. Some of these characteristics have been used to propose and improve meta-heuristics for global optimization; however,…
Cellular automata (CA) exemplify systems where simple local interaction rules can lead to intricate and complex emergent phenomena at large scales. The various types of dynamical behavior of CA are usually categorized empirically into…