相关论文: Synchronization and Maximum Lyapunov Exponents of …
Cellular automata (CA) have long attracted attention as dynamical systems with local updating rules and yet can exhibit, for certain rules, complex, long space and time correlated patterns. This contrast with other rules which results in…
Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
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…
We propose a general Langevin equation describing the universal properties of synchronization transitions in extended systems. By means of theoretical arguments and numerical simulations we show that the proposed equation exhibits,…
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…
We have developed a simple cellular automata model for nonlinearly coupled phase oscillators which can exhibit many important collective dynamical states found in other synchronizing systems. The state of our system is specified by a set of…
Spatially extended dynamical systems, namely coupled map lattices, driven by additive spatio-temporal noise are shown to exhibit stochastic synchronization. In analogy with low-dymensional systems, synchronization can be achieved only if…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
We study the predictability of emergent phenomena in complex systems. Using nearest neighbor, one-dimensional Cellular Automata (CA) as an example, we show how to construct local coarse-grained descriptions of CA in all classes of Wolfram's…
Auxiliary system approach and various nearest neighbor methods are widely used to detect generalized synchronization in non-identical coupled systems. These methods generally give contradictory results. Therefore one method alone is not…
We investigate a transition from chaotic to nonchaotic behavior and synchronization in an ensemble of systems driven by identical random forces. We analyze the synchronization phenomenon in the ensemble of particles moving with friction in…
The expanding cellular automata (XCA) variant of cellular automata is investigated and characterized from a complexity-theoretical standpoint. An XCA is a one-dimensional cellular automaton which can dynamically create new cells between…
The threshold, or saturation phenomenon of spatially coupled systems is revisited in the light of Lyapunov's theory of dynamical systems. It is shown that an application of Lyapunov's direct method can be used to quantitatively describe 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,…
The synchronization behavior of networked chaotic oscillators with periodic coupling is investigated. It is observed in simulations that the network synchronizability could be significantly influenced by tuning the coupling frequency, even…
The cellular automata (CA) approach to traffic modeling is extended to allow for spatially homogeneous steady state solutions that cover a two dimensional region in the flow-density plane. Hence these models fulfill a basic postulate of a…
We provide appropriate tools for the analysis of dynamics and chaos for one-dimensional systems with periodic boundary conditions. Our approach allows for the investigation of the dependence of the largest Lyapunov exponent on various…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
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…