A network of chaotic units is investigated where the units are coupled by signals with a transmission delay. Any arbitrary finite network is considered where the chaotic trajectories of the uncoupled units are a solution of the dynamic equations of the network. It is shown that chaotic trajectories cannot be synchronized if the transmission delay is larger than the time scales of the individual units. For several models the master stability function is calculated which determines the maximal delay time for which synchronization is possible.
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.
Networks of nonlinear units with time-delayed couplings can synchronize to a common chaotic trajectory. Although the delay time may be very large, the units can synchronize completely without time shift. For networks of coupled Bernoulli maps, analytic results are derived for the stability of the chaotic synchronization manifold.For a single delay time, chaos synchronization is related to the spectral gap of the coupling matrix. For networks with multiple delay times, analytic results are obtained from the theory of polynomials. Finally, the analytic results are compared with networks of iterated tent maps and Lang-Kobayashi equations which imitate the behaviour of networks of semiconductor lasers.
Chaos synchronization, in particular isochronal synchronization of two chaotic trajectories to each other, may be used to build a means of secure communication over a public channel. In this paper, we give an overview of coupling schemes of Bernoulli units deduced from chaotic laser systems, different ways to transmit information by chaos synchronization and the advantage of bidirectional over unidirectional coupling with respect to secure communication. We present the protocol for using dynamical private commutative filters for tap-proof transmission of information that maps the task of a passive attacker to the class of non-deterministic polynomial time-complete problems.
Zero-lag synchronization (ZLS) between chaotic units, which do not have self-feedback or a relay unit connecting them, is experimentally demonstrated for two mutually coupled chaotic semiconductor lasers. The mechanism is based on two mutual coupling delay times with certain allowed integer ratios, whereas for a single mutual delay time ZLS cannot be achieved. This mechanism is also found numerically for mutually coupled chaotic maps where its stability is analyzed using the Schur-Cohn theorem for the roots of polynomials. The symmetry of the polynomials allows only specific integer ratios for ZLS. In addition, we present a general argument for ZLS when several mutual coupling delay times are present.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.