Summary
2011 International Symposium on Nonlinear Theory and Its Applications
2011
Session Number:A1L-D
Session:
Number:A1L-D1
Clustering in time delay chaotic networks and the greatest common divisor
Ido Kanter, Meital Zigzag, Wolfgang Kinzel,
pp.52-55
Publication Date:2011/9/4
Online ISSN:2188-5079
Summary:
We present the interplay between synchronization of coupled chaotic nodes with heterogeneous delays and the greatest common divisor (GCD) of loops composing the graph. In the weak chaos region and for GCD=1 the network is in chaotic zero-lag synchronization (ZLS), whereas for GCD=m > 1 synchronization of m-clusters emerges. ZLS is achievable even in oriented graphs. The role of GCD is a global decision and cannot be deduced from local topological or geometric properties of the network. Results are supported by simulations of chaotic systems, self-consistent and mixing arguments, as well as analytical solutions of Bernoulli maps.