pith. sign in

arxiv: 1012.0990 · v2 · pith:U37BORD3new · submitted 2010-12-05 · 🌊 nlin.CD · physics.bio-ph

Synchronization of unidirectional time delay chaotic networks and the greatest common divisor

classification 🌊 nlin.CD physics.bio-ph
keywords chaoticsynchronizationdelayscommondivisorgreatestnodesunidirectional
0
0 comments X
read the original abstract

We present the interplay between synchronization of unidirectional coupled chaotic nodes with heterogeneous delays and the greatest common divisor (GCD) of loops composing the oriented graph. In the weak chaos region and for GCD=1 the network is in chaotic zero-lag synchronization, whereas for GCD=m>1 synchronization of m-sublattices emerges. Complete synchronization can be achieved when all chaotic nodes are influenced by an identical set of delays and in particular for the limiting case of homogeneous delays. Results are supported by simulations of chaotic systems, self-consistent and mixing arguments, as well as analytical solutions of Bernoulli maps.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.