Information transfer and nontrivial collective behavior in chaotic coupled map networks (original) (raw)

Mutual synchronization and clustering in randomly coupled chaotic dynamical networks

Physical Review E, 1999

We introduce and study systems of randomly coupled maps (RCM) where the relevant parameter is the degree of connectivity in the system. Global (almost-) synchronized states are found (equivalent to the synchronization observed in globally coupled maps) until a certain critical threshold for the connectivity is reached. We further show that not only the average connectivity, but also the architecture of the couplings is responsible for the cluster structure observed. We analyse the different phases of the system and use various correlation measures in order to detect ordered non-synchronized states. Finally, it is shown that the system displays a dynamical hierarchical clustering which allows the definition of emerging graphs.

Delays, Connection Topology, and Synchronization of Coupled Chaotic Maps

Physical Review Letters, 2004

We consider networks of coupled maps where the connections between units involve time delays. We show that, similar to the undelayed case, the synchronization of the network depends on the connection topology, characterized by the spectrum of the graph Laplacian. Consequently, scale-free and random networks are capable of synchronizing despite the delayed flow of information, whereas regular networks with nearest-neighbor

Heterogeneity-induced order in globally coupled chaotic systems

Europhysics Letters (EPL), 1997

Collective behavior is studied in globally coupled maps with distributed nonlinearity. It is shown that the heterogeneity enhances regularity in the collective dynamics. Low-dimensional quasi-periodic motion is often found for the mean field, even if each element shows chaotic dynamics. The mechanism of this order is due to the formation of an internal bifurcation structure, and the self-consistent dynamics between the structures and the mean field.

Synchronization learning of coupled chaotic maps

The European Physical Journal B, 2001

We study the dynamics of an ensemble of globally coupled chaotic logistic maps under the action of a learning algorithm aimed at driving the system from incoherent collective evolution to a state of spontaneous full synchronization. Numerical calculations reveal a sharp transition between regimes of unsuccessful and successful learning as the algorithm stiffness grows. In the regime of successful learning, an optimal value of the stiffness is found for which the learning time is minimal.

Spontaneous Structure Formation in a Network of Chaotic Units with Variable Connection Strengths

Physical Review Letters, 2001

As a model of temporally evolving networks, we consider a globally coupled logistic map with variable connection weights. The model exhibits self-organization of network structure, reflected by the collective behavior of units. Structural order emerges even without any interunit synchronization of dynamics. Within this structure, units spontaneously separate into two groups whose distinguishing feature is that the first group possesses many outwardly directed connections to the second group, while the second group possesses only a few outwardly directed connections to the first. The relevance of the results to structure formation in neural networks is briefly discussed.

Does synchronization of networks of chaotic maps lead to control?

Chaos: An Interdisciplinary Journal of Nonlinear Science, 2005

We consider networks of chaotic maps with different network topologies. In each case, they are coupled in such a way as to generate synchronized chaotic solutions. By using the methods of control of chaos we are controlling a single map into a predetermined trajectory. We analyze the reaction of the network to such a control. Specifically we show that a line of one-dimensional logistic maps that are unidirectionally coupled can be controlled from the first oscillator whereas a ring of diffusively coupled maps cannot be controlled for more than 5 maps. We show that rings with more elements can be controlled if every third map is controlled. The dependence of unidirectionally coupled maps on noise is studied. The noise level leads to a finite synchronization lengths for which maps can be controlled by a single location. A two-dimensional lattice is also studied.

Coherence in scale-free networks of chaotic maps

Physical Review E, 2004

We study fully synchronized states in scale-free networks of chaotic logistic maps as a function of both dynamical and topological parameters. Three different network topologies are considered: (i) a random scalefree topology, (ii) a deterministic pseudofractal scale-free network, and (iii) an Apollonian network. For the random scale-free topology we find a coupling strength threshold beyond which full synchronization is attained. This threshold scales as k − , where k is the outgoing connectivity and depends on the local nonlinearity. For deterministic scale-free networks coherence is observed only when the coupling strength is proportional to the neighbor connectivity. We show that the transition to coherence is of first order and study the role of the most connected nodes in the collective dynamics of oscillators in scale-free networks.

State Predictability and Information Flow in Simple Chaotic Systems

Zeitschrift für Naturforschung A

The possibility of state prediction in deterministic chaotic systems, which are described by 1-D maps, is discussed in the light o f information theory. A quantity h(l) is defined which represents the production of uncertainty on a future state by the chaotic dynamics (intrinsic noise) after / time steps have passed. h(l) is related to the Lyapunov characteristic exponent. Moreover, the influence of the measuring process (overlappings o f mapped boxes o f state space partition) and external noise on the state predictability are investigated quantitatively.

Synchronization and Phase Ordering in Globally Coupled Chaotic Maps

Springer Proceedings in Mathematics & Statistics, 2015

We investigate the processes of synchronization and phase ordering in a system of globally coupled maps possessing bistable, chaotic local dynamics. The stability boundaries of the synchronized states are determined on the space of parameters of the system. The collective properties of the system are characterized by means of the persistence probability of equivalent spin variables that define two phases, and by a magnetization-like order parameter that measures the phase-ordering behavior. As a consequence of the global interaction, the persistence probability saturates for all values of the coupling parameter, in contrast to the transition observed in the temporal behavior of the persistence in coupled maps on regular lattices. A discontinuous transition from a non-ordered state to a collective phase-ordered state takes place at a critical value of the coupling. On an interval of the coupling parameter, we find three distinct realizations of the phase-ordered state, which can be discerned by the corresponding values of the saturation persistence. Thus, this statistical quantity can provide information about the transient behaviors that lead to the different phase configurations in the system. The appearance of disordered and phase-ordered states in the globally coupled system can be understood by calculating histograms and the time evolution of local map variables associated to the these collective states.

Stability of the steady state of delay-coupled chaotic maps on complex networks

Physical Review E, 2008

We study the stability of the steady state of coupled chaotic maps with randomly distributed time delays evolving on a random network. An analysis method is developed based on the peculiar mathematical structure of the Jacobian of the steady state due to time-delayed coupling, which enables us to relate the stability of the steady state to the locations of the roots of a set of lower-order bound equations. For ␦-distributed time delays ͑or fixed time delay͒, we find that the stability of the steady state is determined by the maximum modulus of the roots of a set of algebraic equations, where the only nontrivial coefficient in each equation is one of the eigenvalues of the normalized adjacency matrix of the underlying network. For general distributed time delays, we find a necessary condition for the stable steady state based on the maximum modulus of the roots of a bound equation. When the number of links is large, the nontrivial coefficients of the bound equation are just the probabilities of different time delays. Our study thus establishes the relationship between the stability of the steady state and the probability distribution of time delays, and provides a better way to investigate the influence of the distributed time delays in coupling on the global behavior of the systems.