.png){kind=icon}
.png){kind=icon}
Return
Synchronization in Directed Complex Networks Using Graph Comparison Tools
.png){kind=icon}
OA
AI
DOI：10.1109/TCSI.2015.2395632.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes lower bounds for the coupling strengths of oscillators in directed networks to guarantee global synchronization. The novel idea of graph comparison from spectral graph theory is employed so that the combinatorial features of a given network can be fully utilized to simplify computations. For large networks that can be decomposed into a set of smaller strongly connected components, the comparison can be carried out at the local level as well. To validate theoretical analysis, examples are provided to demonstrate how to apply the proposed methodologies to typical directed complex networks.
Keywords:
Coupling strength allocation
directed complex networks
spectral graph theory
synchronization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.2
Papers:
9.7K
Citations:
2.2W
Organization
View more organizations