Global Synchronization of Discrete-Time Dynamical Network With a Directed Graph

Abstract

We investigate synchronization of linearly coupled map lattices with asymmetric and irreducible coupling matrices. In terms of graph terminology, the coupling matrix represents a directed graph. In case the uncoupled map satisfies Lipschitz conditions, a criterion of global synchronization of the linearly coupled map lattices is derived. With this criterion, we investigate how synchronizability depends on the coupling matrix as well as graph topology. Furthermore, we also prove that a directed graph can synchronize some chaotic map if and only if the graph contains a spanning tree.

DOI: 10.1109/TCSII.2006.886236

Extracted Key Phrases

1 Figure or Table

02040602008200920102011201220132014201520162017
Citations per Year

121 Citations

Semantic Scholar estimates that this publication has 121 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Lu2007GlobalSO, title={Global Synchronization of Discrete-Time Dynamical Network With a Directed Graph}, author={Wenlian Lu and Tianping Chen}, journal={IEEE Trans. on Circuits and Systems}, year={2007}, volume={54-II}, pages={136-140} }