About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
ISCAS 1998
Conference paper
Global synchronization in coupled map lattices
Abstract
This paper presents a global synchronization theorem for coupled map lattices. Roughly speaking the theorem states that the coupled map lattice Xn+1 = AF(xn) synchronizes if A has an eigenvalue 1 of multiplicity 1 corresponding to the synchronization manifold and the other eigenvalues of A are close to zero. Examples of coupled map lattices of logistic maps are used to illustrate the result. In particular, we give global results regarding synchronization in coupled map lattices for which previously only numerical evidence and local results were available. We show that (1) globally coupled maps synchronize if the coupling is large enough, (2) randomly coupled maps are synchronized if the number of couplings for each map is large enough and (3) coupled maps connected on a graph will synchronize if the ratio between the largest and the smallest nonzero eigenvalue of the Laplacian matrix of the graph is small.