Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/TCSI.2015.2395632 | IEEE Trans. on Circuits and Systems |
Keywords | Field | DocType |
directed complex networks,coupling strength allocation,coupling strength,graph comparison tool,complex networks,synchronization,oscillator,directed graphs,global synchronization,oscillators,spectral graph theory,synchronisation,couplings,graph theory,symmetric matrices | Graph theory,Geometric networks,Directed graph,Power graph analysis,Theoretical computer science,Wait-for graph,Complex network,Strongly connected component,Mathematics,Moral graph | Journal |
Volume | Issue | ISSN |
62 | 4 | 1549-8328 |
Citations | PageRank | References |
7 | 0.43 | 6 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hui Liu | 1 | 24 | 2.53 |
| Ming Cao | 2 | 2343 | 249.61 |
| Chai Wah Wu | 3 | 330 | 67.62 |
| Junan Lu | 4 | 651 | 55.81 |
| Chi K. Tse | 5 | 1153 | 155.94 |