Graph Theory-Based Pinning Synchronization of Stochastic Complex Dynamical Networks
IEEE Transactions on Neural Networks and Learning Systems2016Vol. 28(2), pp. 427–437
Citations Over TimeTop 10% of 2016 papers
Abstract
This paper is concerned with the adaptive pinning synchronization problem of stochastic complex dynamical networks (CDNs). Based on algebraic graph theory and Lyapunov theory, pinning controller design conditions are derived, and the rigorous convergence analysis of synchronization errors in the probability sense is also conducted. Compared with the existing results, the topology structures of stochastic CDN are allowed to be unknown due to the use of graph theory. In particular, it is shown that the selection of nodes for pinning depends on the unknown lower bounds of coupling strengths. Finally, an example on a Chua's circuit network is given to validate the effectiveness of the theoretical results.
Related Papers
- → Ultrafast consensus in small-world networks(2005)384 cited
- → Distributed algebraic connectivity estimation for undirected graphs with upper and lower bounds(2014)64 cited
- → Algebraic Connectivity Control in Distributed Networks by Using Multiple Communication Channels(2021)7 cited
- → Leader-follower consensus control of multi-agent systems with extended Laplacian matrix(2015)6 cited
- → The consensus protocol for multi-agent systems based on the algebraic connectivity(2008)