arXiv subjects

Wolfgang Kinzel

Publications and source records attributed to Wolfgang Kinzel.

At least 19 recordsLinked to original sources

arXiv2018

Understanding the enhanced synchronization of delay-coupled networks with fluctuating topology

We study the dynamics of networks with coupling delay, from which the connectivity changes over time. The synchronization properties are shown to depend on the interplay of three time scales: the internal time scale of the dynamics, the coupling delay along the network links and time scale at which the topology changes. Concentrating on a linearized model, we develop an analytical theory for the stability of a synchronized solution. In two limit cases the system can be reduced to an "effective" topology: In the fast switching approximation, when the network fluctuations are much faster than the internal time scale and the coupling delay, the effective network topology is the arithmetic mean over the different topologies. In the slow network limit, when the network fluctuation time scale is equal to the coupling delay, the effective adjacency matrix is the geometric mean over the adjacency matrices of the different topologies. In the intermediate regime the system shows a sensitive dependence on the ratio of time scales, and specific topologies, reproduced as well by numerical simulations. Our results are shown to describe the synchronization properties of fluctuating networks of delay-coupled chaotic maps.

cond-mat.stat-mech↗

arXiv2016

Chaos synchronization by resonance of multiple delay times

Chaos synchronization may arise in networks of nonlinear units with delayed couplings. We study complete and sublattice synchronization generated by resonance of two large time delays with a specific ratio. As it is known for single delay networks, the number of synchronized sublattices is determined by the Greatest Common Divisor (GCD) of the network loops lengths. We demonstrate analytically the GCD condition in networks of iterated Bernouilli maps with multiple delay times and complement our analytic results by numerical phase diagrams, providing parameter regions showing complete and sublattice synchronization by resonance for Tent and Bernouilli maps. We compare networks with the same GCD with single and multiple delays, and we investigate the sensitivity of the correlation to a detuning between the delays in a network of coupled Stuart-Landau oscillators. Moreover, the GCD condition also allows to detect time delay resonances leading to high correlations in non-synchronizable networks. Specifically, GCD-induced resonances are observed both in a chaotic asymmetric network and in doubly connected rings of delay-coupled noisy linear oscillators.

nlin.CD↗

arXiv2015

On the effect of the drive on self-organized criticality

The well known Sandpile model of self-organized criticality generates avalanches of all length and time scales, without tuning any parameters. In the original models the external drive is randomly selected. Here we investigate a drive which depends on the present state of the system, namely the effect of favoring sites with a certain height in the deposition process. If sites with height three are favored, the system stays in a critical state. Our numerical results indicate the same universality class as the original model with random depositition, although the stationary state is approached very differently. In constrast, when favoring sites with height two, only avalanches which cover the entire system occur. Furthermore, we investigate the distributions of sites with a certain height, as well as the transient processes of the different variants of the external drive.

cond-mat.stat-mech↗

arXiv2014

Stochastic switching in delay-coupled oscillators

A delay is known to induce multistability in periodic systems. Under influence of noise, coupled oscillators can switch between coexistent orbits with different frequencies and different oscillation patterns. For coupled phase oscillators we reduce the delay system to a non-delayed Langevin equation, which allows us to analytically compute the distribution of frequencies, and their corresponding residence times. The number of stable periodic orbits scales with the roundtrip delay time and coupling strength, but the noisy system visits only a fraction of the orbits, which scales with the square root of the delay time and is independent of the coupling strength. In contrast, the residence time in the different orbits is mainly determined by the coupling strength and the number of oscillators, and only weakly dependent on the coupling delay. Finally we investigate the effect of a detuning between the oscillators. We demonstrate the generality of our results with delay-coupled FitzHugh-Nagumo oscillators.

nlin.AO↗

arXiv2013

Synchronization and scaling properties of chaotic networks with multiple delays

We study chaotic systems with multiple time delays that range over several orders of magnitude. We show that the spectrum of Lyapunov exponents (LE) in such systems possesses a hierarchical structure, with different parts scaling with the different delays. This leads to different types of chaos, depending on the scaling of the maximal LE. Our results are relevant, in particular, for the synchronization properties of hierarchical networks (networks of networks) where the nodes of subnetworks are coupled with shorter delays and couplings between different subnetworks are realized with longer delay times. Units within a subnetwork can synchronize if the maximal exponent scales with the shorter delay, long range synchronization between different subnetworks is only possible if the maximal exponent scales with the long delay. The results are illustrated analytically for Bernoulli maps and numerically for tent maps.

nlin.CD↗

arXiv2013

Pulsed chaos synchronization in networks with adaptive couplings

Networks of chaotic units with static couplings can synchronize to a common chaotic trajectory. The effect of dynamic adaptive couplings on the cooperative behavior of chaotic networks is investigated. The couplings adjust to the activities of its two units by two competing mechanisms: An exponential decrease of the coupling strength is compensated by an increase due to de-synchronized activity. This mechanism prevents the network from reaching a steady state. Numerical simulations of a coupled map lattice show chaotic trajectories of de-synchronized units interrupted by pulses of mutually synchronized clusters. These pulses occur on all scales, sometimes extending to the entire network. Clusters of synchronized units can be triggered by a small group of synchronized units.

nlin.CD↗

arXiv2013

Chaos Pass Filter: Linear Response of Synchronized Chaotic Systems

The linear response of synchronized chaotic units with delayed couplings and feedback to small external perturbations is investigated in the context of communication with chaos synchronization. For iterated chaotic maps, the distribution of distances is calculated numerically and, for some special cases, analytically as well. Depending on model parameters, this distribution has power law tails leading to diverging moments of distances in the region of synchronization. The corresponding linear equations have multiplicative and additive noise due to perturbations and chaos. The response to small harmonic perturbations shows resonances related to coupling and feedback delay times. For perturbation from a binary message the bit error rate is calculated. The bit error rate is not related to the transverse Lyapunov exponents, and it can be reduced when additional noise is added to the transmitted signal. For some special cases, the bit error rate as a function of coupling strength has the structure of a devil's staircase, related to an iterated function system. Finally, the security of communication is discussed by comparing uni- and bi-directional couplings.

nlin.CD↗

arXiv2013

Chaos Pass Filter: Linear Response of Synchronized Chaotic Systems

The linear response of synchronized time-delayed chaotic systems to small external perturbations, i.e., the phenomenon of chaos pass filter, is investigated for iterated maps. The distribution of distances, i.e., the deviations between two synchronized chaotic units due to external perturbations on the transfered signal, is used as a measure of the linear response. It is calculated numerically and, for some special cases, analytically. Depending on the model parameters this distribution has power law tails in the region of synchronization leading to diverging moments of distances. This is a consequence of multiplicative and additive noise in the corresponding linear equations due to chaos and external perturbations. The linear response can also be quantified by the bit error rate of a transmitted binary message which perturbs the synchronized system. The bit error rate is given by an integral over the distribution of distances and is calculated analytically and numerically. It displays a complex nonmonotonic behavior in the region of synchronization. For special cases the distribution of distances has a fractal structure leading to a devil's staircase for the bit error rate as a function of coupling strength. The response to small harmonic perturbations shows resonances related to coupling and feedback delay times. A bi-directionally coupled chain of three units can completely filtered out the perturbation. Thus the second moment and the bit error rate become zero.

nlin.CD↗

arXiv2012

Scaling of Lyapunov exponents in chaotic delay systems

The scaling behavior of the maximal Lyapunov exponent in chaotic systems with time-delayed feedback is investigated. For large delay times it has been shown that the delay-dependence of the exponent allows a distinction between strong and weak chaos, which are the analogy to strong and weak instability of periodic orbits in a delay system. We find significant differences between scaling of exponents in periodic or chaotic systems. We show that chaotic scaling is related to fluctuations in the linearized equations of motion. A linear delay system including multiplicative noise shows the same properties as the deterministic chaotic systems.

nlin.CD↗

arXiv2012

Discontinuous Attractor Dimension at the Synchronization Transition of Time-Delayed Chaotic Systems

The attractor dimension at the transition to complete synchronization in a network of chaotic units with time-delayed couplings is investigated. In particular, we determine the Kaplan-Yorke dimension from the spectrum of Lyapunov exponents for iterated maps and for two coupled semiconductor lasers. We argue that the Kaplan-Yorke dimension must be discontinuous at the transition and compare it to the correlation dimension. For a system of Bernoulli maps we indeed find a jump in the correlation dimension. The magnitude of the discontinuity in the Kaplan-Yorke dimension is calculated for networks of Bernoulli units as a function of the network size. Furthermore the scaling of the Kaplan-Yorke dimension as well as of the Kolmogorov entropy with system size and time delay is investigated.

nlin.CD↗

arXiv2012

Strong and Weak Chaos in Networks of Semiconductor Lasers with Time-delayed Couplings

Nonlinear networks with time-delayed couplings may show strong and weak chaos, depending on the scaling of their Lyapunov exponent with the delay time. We study strong and weak chaos for semiconductor lasers, either with time-delayed self-feedback or for small networks. We examine the dependence on the pump current and consider the question whether strong and weak chaos can be identified from the shape of the intensity trace, the auto-correlations and the external cavity modes. The concept of the sub-Lyapunov exponent $λ_0$ is generalized to the case of two time-scale separated delays in the system. We give the first experimental evidence of strong and weak chaos in a network of lasers which supports the sequence 'weak to strong to weak chaos' upon monotonically increasing the coupling strength. Finally, we discuss strong and weak chaos for networks with several distinct sub-Lyapunov exponents and comment on the dependence of the sub-Lyapunov exponent on the number of a laser's inputs in a network.

nlin.CD↗

arXiv2011

Strong and weak chaos in nonlinear networks with time-delayed couplings

We study chaotic synchronization in networks with time-delayed coupling. We introduce the notion of strong and weak chaos, distinguished by the scaling properties of the maximum Lyapunov exponent within the synchronization manifold for large delay times, and relate this to the condition for stable or unstable chaotic synchronization, respectively. In simulations of laser models and experiments with electronic circuits, we identify transitions from weak to strong and back to weak chaos upon monotonically increasing the coupling strength.

nlin.CD↗

arXiv2010

Pulses of chaos synchronization in coupled map chains with delayed transmission

Pulses of synchronization in chaotic coupled map lattices are discussed in the context of transmission of information. Synchronization and desynchronization propagate along the chain with different velocities which are calculated analytically from the spectrum of convective Lyapunov exponents. Since the front of synchronization travels slower than the front of desynchronization, the maximal possible chain length for which information can be transmitted by modulating the first unit of the chain is bounded.

cond-mat.dis-nn↗

arXiv2008

Emergence of zero-lag synchronization in generic mutually coupled chaotic systems

Zero-lag synchronization (ZLS) is achieved in a very restricted mutually coupled chaotic systems, where the delays of the self-coupling and the mutual coupling are identical or fulfil some restricted ratios. Using a set of multiple self-feedbacks we demonstrate both analytically and numerically that ZLS is achieved for a wide range of mutual delays. It indicates that ZLS can be achieved without the knowledge of the mutual distance between the communicating partners and has an important implication in the possible use of ZLS in communications networks as well as in the understanding of the emergence of such synchronization in the neuronal activities.

nlin.CD↗

arXiv2008

Public Channel Cryptography: Chaos Synchronization and Hilbert's Tenth Problem

The synchronization process of two mutually delayed coupled deterministic chaotic maps is demonstrated both analytically and numerically. The synchronization is preserved when the mutually transmitted signal is concealed by two commutative private filters that are placed on each end of the communication channel. We demonstrate that when the transmitted signal is a convolution of the truncated time delayed output signals or some powers of the delayed output signals synchronization is still maintained. The task of a passive attacker is mapped onto Hilbert's tenth problem, solving a set of nonlinear Diophantine equations, which was proven to be in the class of NP-Complete problems. This bridge between two different disciplines, synchronization in nonlinear dynamical processes and the realm of the NPC problems, opens a horizon for a new type of secure public-channel protocols.

nlin.CD↗

arXiv2008

Patterns of Chaos Synchronization

Small networks of chaotic units which are coupled by their time-delayed variables, are investigated. In spite of the time delay, the units can synchronize isochronally, i.e. without time shift. Moreover, networks can not only synchronize completely, but can also split into different synchronized sublattices. These synchronization patterns are stable attractors of the network dynamics. Different networks with their associated behaviors and synchronization patterns are presented. In particular, we investigate sublattice synchronization, symmetry breaking, spreading chaotic motifs, synchronization by restoring symmetry and cooperative pairwise synchronization of a bipartite tree.

nlin.CD↗

arXiv2007

Chaos Synchronization with Dynamic Filters: Two Way is Better Than One Way

Two chaotic systems which interact by mutually exchanging a signal built from their delayed internal variables, can synchronize. A third unit may be able to record and to manipulate the exchanged signal. Can the third unit synchronize to the common chaotic trajectory, as well? If all parameters of the system are public, a proof is given that the recording system can synchronize as well. However, if the two interacting systems use private commutative filters to generate the exchanged signal, a driven system cannot synchronize. It is shown that with dynamic private filters the chaotic trajectory even cannot be calculated. Hence two way (interaction) is more than one way (drive). The implication of this general result to secret communication with chaos synchronization is discussed.

nlin.CD↗

arXiv2007

Dynamics of neural cryptography

Synchronization of neural networks has been used for novel public channel protocols in cryptography. In the case of tree parity machines the dynamics of both bidirectional synchronization and unidirectional learning is driven by attractive and repulsive stochastic forces. Thus it can be described well by a random walk model for the overlap between participating neural networks. For that purpose transition probabilities and scaling laws for the step sizes are derived analytically. Both these calculations as well as numerical simulations show that bidirectional interaction leads to full synchronization on average. In contrast, successful learning is only possible by means of fluctuations. Consequently, synchronization is much faster than learning, which is essential for the security of the neural key-exchange protocol. However, this qualitative difference between bidirectional and unidirectional interaction vanishes if tree parity machines with more than three hidden units are used, so that those neural networks are not suitable for neural cryptography. In addition, the effective number of keys which can be generated by the neural key-exchange protocol is calculated using the entropy of the weight distribution. As this quantity increases exponentially with the system size, brute-force attacks on neural cryptography can easily be made unfeasible.

cond-mat.dis-nn↗