Global synchronization of discrete time dynamical network with a directed graph
Wenlian Lu and Tianping Chen
Contact the author: Please use for correspondence this email.
Submission date: 09. Oct. 2006 (revised version: November 2006)
published in: IEEE transactions on circuits and systems / 2, 54 (2007) 2, p. 136-140
DOI number (of the published article): 10.1109/TCSII.2006.886236
PACS-Numbers: 05.45.Ra, 05.45.Xt, 02.10.Ox
Keywords and phrases: synchronization, linearly coupled map lattices, diagonally stable, directed graph, spanning tree
Download full preprint: PDF (194 kB)
We investigate synchronization of linearly coupled map lattices with asymmetric and irreducible coupling matrices. In terms of graph theory, the coupling matrix represents a directed graph. In case that the uncoupled map satisfies Lipschitz conditions, a criterion of global synchronization of the coupled system is derived. With this criterion, we investigate how synchronizability depends on the coupling matrix as well as graph topology. In Wu 2005, the author proved that for linearly coupled continuous networks, chaos can be synchronized if and only if the graph contains a spanning tree. In this paper, we show that this conclusion also holds for linearly coupled map lattices.