By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Wenlian Lu ; Max-Planck-Inst. fur Math. in the Sci., Leipzig ; Tianping Chen

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

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:54 ,  Issue: 2 )