Synchronization in Directed Complex Networks Using Graph Comparison Tools

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.

[1]  Brian D. O. Anderson,et al.  Reaching a Consensus in a Dynamically Changing Environment: Convergence Rates, Measurement Delays, and Asynchronous Events , 2008, SIAM J. Control. Optim..

[2]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[3]  C. Wu.  Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systems , 2003, nlin/0307052.

[4]  L. Chua,et al.  Synchronization in an array of linearly coupled dynamical systems , 1995 .

[5]  T. Carroll,et al.  MASTER STABILITY FUNCTIONS FOR SYNCHRONIZED COUPLED SYSTEMS , 1999 .

[6]  Chris Arney.  Sync: The Emerging Science of Spontaneous Order , 2007 .

[7]  Anna Filomena Carbone,et al.  Power Grid Complexity , 2011 .

[8]  M. Hasler,et al.  Synchronization in asymmetrically coupled networks with node balance. , 2006, Chaos.

[9]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[10]  Daniel A. Spielman,et al.  Spectral Graph Theory and its Applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[11]  Hui Liu,et al.  New spectral graph theoretic conditions for synchronization in directed complex networks , 2013, 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013).

[12]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[13]  Ming Cao,et al.  Graph comparison and its application in network synchronization , 2013, 2013 European Control Conference (ECC).

[14]  Daniel A. Spielman,et al.  Spectral Graph Theory , 2012 .

[15]  M. Hasler,et al.  Connection Graph Stability Method for Synchronized Coupled Chaotic Systems , 2004 .

[16]  S. Bhat,et al.  Lyapunov analysis of semistability , 1999, Proceedings of the 1999 American Control Conference (Cat. No. 99CH36251).

[17]  Hui Liu,et al.  Coupling Strength Allocation for Synchronization in Complex Networks Using Spectral Graph Theory , 2014, IEEE Transactions on Circuits and Systems I: Regular Papers.

[18]  Jinhu Lu,et al.  Bifurcation Analysis of Synchronized Regions in Complex Dynamical Networks , 2012, Int. J. Bifurc. Chaos.

[19]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[20]  Henk Nijmeijer,et al.  Synchronization and Graph Topology , 2005, Int. J. Bifurc. Chaos.

[21]  Richard A. Brualdi,et al.  Combinatorial matrix theory , 1991 .

[22]  Martin Hasler,et al.  Generalized connection graph method for synchronization in asymmetrical networks , 2006 .