Graph comparison and its application in network synchronization

Using the tool of graph comparison from spectral graph theory, we propose new methodologies to guarantee complete synchronization in complex networks. The main idea is to utilize flexibly topological features of a given network so that the eigenvalues of the Laplacian matrix associated with the network can be estimated. The proposed methodologies enable the construction of different coupling-strength combinations in response to different knowledge about sub-networks. The obtained bounds of the network graphs' eigenvalues can be further used to study the robust synchronization problem in face of link failures in networks. Examples are utilized to demonstrate how to apply the methodologies to networks.

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

[2]  Daniel A. Spielman.  Lecture notes from IPCO Summer School 2005 Fast Randomized Algorithms for Partitioning, Sparsification, and Solving Linear Systems , 2005 .

[3]  T. Carroll,et al.  Master Stability Functions for Synchronized Coupled Systems , 1998 .

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

[5]  Gary L. Miller,et al.  Graph Embeddings and Laplacian Eigenvalues , 2000, SIAM J. Matrix Anal. Appl..

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

[7]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[8]  Chai Wah Wu,et al.  Synchronization in Complex Networks of Nonlinear Dynamical Systems , 2008 .

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

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

[11]  Daizhan Cheng,et al.  Characterizing the synchronizability of small-world dynamical networks , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.

[12]  Naomi Ehrich Leonard,et al.  Robustness of noisy consensus dynamics with directed communication , 2010, Proceedings of the 2010 American Control Conference.

[13]  I. Gutman,et al.  Resistance distance and Laplacian spectrum , 2003 .

[14]  Nabil Kahale,et al.  A semidefinite bound for mixing rates of Markov chains , 1996, Random Struct. Algorithms.

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

[16]  Magnus Egerstedt,et al.  Robust Graph Topologies for Networked Systems , 2012 .

[17]  Gary L. Miller,et al.  The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a Laplacian , 1997, Combinatorics, Probability and Computing.

[18]  Dennis S. Bernstein,et al.  Matrix Mathematics: Theory, Facts, and Formulas with Application to Linear Systems Theory , 2005 .

[19]  Xiao Fan Wang,et al.  Synchronization in scale-free dynamical networks: robustness and fragility , 2001, cond-mat/0105014.

[20]  Guanrong Chen,et al.  Chaos synchronization of general complex dynamical networks , 2004 .