科研之友
微信
新浪微博
Facebook
分享链接
摘要
Synchronization in complex networks has been widely investigated recently. However, if a network cannot reach synchrony by itself, pinning control needs to be applied on a small fraction of vertices in the network. In the last decade, many pinning schemes were designed for choosing appropriate pinning vertices. However, the challenging problem as which vertices should be controlled to achieve the best performance for synchronization still has no solution. This paper focuses on the first step toward this challenging open problem. By using spectral analysis and algebraic graph theory tools to separate the network, it is found that an optimal vertex for pinning a network to achieve the best performance in synchronization must be in the matched pinning component or the matched cut vertex set.
- 出版日期2013
- 单位中国科学院; 东南大学; 中国科学院数学与系统科学研究院; 香港城市大学
