Complete synchronization equivalence in asynchronous and delayed coupled maps
arXiv:1512.03760 · doi:10.1103/PhysRevE.93.052230
Abstract
Coupled map lattices are paradigmatic models of many collective phenomena. However, quite different patterns can emerge depending on the updating scheme. While in early versions, maps were updated synchronously, there has been in recent years a concern to consider more realistic updating schemes where elements do not change all at once. Asynchronous updating schemes and the inclusion of time delays are seen as more realistic than the traditional parallel dynamics, and, in diverse works, either one or the other has been implemented separately. But are they actually distinct cases? For coupled map lattices with adjustable range of interactions, we prove, using both numerical and analytical tools, that an adequate delayed dynamics leads to the same completely synchronized states as an asynchronous update, providing a unified framework to identify the stability conditions for complete synchronization.
arXiv comment6 pages and 4 figures
References in corpus (11)
- Long-range interacting rotators: connection with the mean--field approximation
- Random Delays and the Synchronization of Chaotic Maps
- Coherence in scale-free networks of chaotic maps
- Role of conviction in nonequilibrium models of opinion formation
- Impact of contrarians and intransigents in a kinetic model of opinion dynamics
- Chaos synchronization in long-range coupled map lattices
- Synchronizability of chaotic logistic maps in delayed complex networks
- Steady-state stabilization due to random delays in maps with self-feedback loops and in globally delayed-coupled maps
- Anomalous synchronization threshold in coupled logistic maps
- Stability analysis of coupled map lattices at locally unstable fixed points
- Inherent global stabilization of unstable local behavior in coupled map lattices