2005
DOI: 10.1088/0951-7715/18/3/007
|View full text |Cite
|
Sign up to set email alerts
|

Synchronization in networks of nonlinear dynamical systems coupled via a directed graph

Abstract: We study synchronization in an array of coupled identical nonlinear dynamical systems where the coupling topology is expressed as a directed graph and give synchronization criteria related to properties of a generalized Laplacian matrix of the directed graph. In particular, we extend recent results by showing that the array synchronizes for sufficiently large cooperative coupling if the underlying graph contains a spanning directed tree. This is an intuitive yet nontrivial result that can be paraphrased as fol… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
153
0
2

Year Published

2006
2006
2022
2022

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 258 publications
(156 citation statements)
references
References 19 publications
0
153
0
2
Order By: Relevance
“…As pointed out in Ref. [15], the connectivity of the graph plays a significant role for chaos synchronization.…”
Section: Introductionmentioning
confidence: 93%
See 1 more Smart Citation
“…As pointed out in Ref. [15], the connectivity of the graph plays a significant role for chaos synchronization.…”
Section: Introductionmentioning
confidence: 93%
“…It can be described by the threshold of the coupling strength to guarantee that the coupled system can synchronize. For complete synchronization, it was formulated as a function of the eigenvalues of symmetric Laplacian [11] or certain Rayleigh quotient of asymmetric Laplacian [15]. How the topology of the underlying graph affects synchronizability is an important issue for the study of complex networks [2].…”
Section: A Clustering Synchronizabilitymentioning
confidence: 99%
“…However, for regular networks such as rings, topics such as synchronization and bifurcations are studied (Kaneko, 1985;Wu, 2005). As discussed earlier, the effects of changes in a network by edge rewirings on epidemic properties are investigated (Eubank, 2010;Chen, 2010).…”
Section: Related Workmentioning
confidence: 99%
“…Indeed, it is always possible to choose an S having as few as two vertices and containing no directed spanning tree. Since the resulting graph G also contains no directed spanning tree, it is incapable of chaotic synchronization [32].…”
Section: Structural Limitations To Synchronizationmentioning
confidence: 99%