Referenced Items are not available for this document.
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
)
Date of Publication: Feb. 2007
- Page(s):
- 136 - 140
- ISSN :
- 1549-7747
- INSPEC Accession Number:
- 9318269
- Digital Object Identifier :
- 10.1109/TCSII.2006.886236
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 20 February 2007
- Issue Date :
- Feb. 2007
- Sponsored by :
- IEEE Circuits and Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
