Coupling Strength Allocation for Synchronization in Complex Networks Using Spectral Graph Theory
- 16 December 2013
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 61 (5), 1520-1530
- https://doi.org/10.1109/tcsi.2013.2285696
Abstract
Using spectral graph theory and especially its graph comparison techniques, we propose new methodologies to allocate coupling strengths to guarantee global complete synchronization in complex networks. The key step is that all the eigenvalues of the Laplacian matrix associated with a given network can be estimated by utilizing flexibly topological features of the network. The proposed methodologies enable the construction of different coupling-strength combinations in response to different knowledge about subnetworks. Adaptive allocation strategies can be carried out as well using only local network topological information. Besides formal analysis, we use simulation examples to demonstrate how to apply the methodologies to typical complex networks.Keywords
Funding Information
- Dutch Organization for Scientific Research (NWO)
- Dutch Technology Foundation (STW)
- European Research Council (ERC-StG-2012-307207)
- National Science Foundation of China (11172215)
This publication has 26 references indexed in Scilit:
- New spectral graph theoretic conditions for synchronization in directed complex networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Connection graph stability method for synchronized coupled chaotic systemsPhysica D: Nonlinear Phenomena, 2004
- Characterizing the Synchronizability of Small-World Dynamical NetworksIEEE Transactions on Circuits and Systems I: Regular Papers, 2004
- Chaos synchronization of general complex dynamical networksPhysica A: Statistical Mechanics and its Applications, 2004
- Perturbation of coupling matrices and its effect on the synchronizability in arrays of coupled chaotic systemsPhysics Letters A, 2003
- Introduction: Control and synchronization in chaotic dynamical systemsChaos: An Interdisciplinary Journal of Nonlinear Science, 2003
- Synchronization in scale-free dynamical networks: robustness and fragilityIEEE Transactions on Circuits and Systems I: Regular Papers, 2002
- Graph Embeddings and Laplacian EigenvaluesSIAM Journal on Matrix Analysis and Applications, 2000
- The Path Resistance Method for Bounding the Smallest Nontrivial Eigenvalue of a LaplacianCombinatorics, Probability and Computing, 1999
- A semidefinite bound for mixing rates of Markov chainsRandom Structures & Algorithms, 1997