节点文献

Are networks with more edges easier to synchronize,or not?

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 段志生王文旭刘超陈关荣

【Author】 Duan Zhi-Sheng a),Wang Wen-Xu b),Liu Chao a),and Chen Guan-Ronga)b) a) State Key Laboratory for Turbulence and Complex Systems,Department of Mechanics and Aerospace Engineering,College of Engineering,Peking University,Beijing 100871,China b) Department of Electronic Engineering,City University of Hong Kong,Hong Kong,China

【机构】 State Key Laboratory for Turbulence and Complex Systems,Department of Mechanics and Aerospace Engineering,College of Engineering,Peking UniversityDepartment of Electronic Engineering,City University of Hong Kong

【摘要】 In this paper,the relationship between network synchronizability and the edge-addition of its associated graph is investigated.First,it is shown that adding one edge to a cycle definitely decreases the network synchronizability.Then,since sometimes the synchronizability can be enhanced by changing the network structure,the question of whether the networks with more edges are easier to synchronize is addressed.Based on a subgraph and complementary graph method,it is shown by examples that the answer is negative even if the network structure is arbitrarily optimized.This reveals that generally there are redundant edges in a network,which not only make no contributions to synchronization but actually may reduce the synchronizability.Moreover,a simple example shows that the node betweenness centrality is not always a good indicator for the network synchronizability.Finally,some more examples are presented to illustrate how the network synchronizability varies following the addition of edges,where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.

【Abstract】 In this paper,the relationship between network synchronizability and the edge-addition of its associated graph is investigated.First,it is shown that adding one edge to a cycle definitely decreases the network synchronizability.Then,since sometimes the synchronizability can be enhanced by changing the network structure,the question of whether the networks with more edges are easier to synchronize is addressed.Based on a subgraph and complementary graph method,it is shown by examples that the answer is negative even if the network structure is arbitrarily optimized.This reveals that generally there are redundant edges in a network,which not only make no contributions to synchronization but actually may reduce the synchronizability.Moreover,a simple example shows that the node betweenness centrality is not always a good indicator for the network synchronizability.Finally,some more examples are presented to illustrate how the network synchronizability varies following the addition of edges,where all the examples show that the network synchronizability globally increases but locally fluctuates as the number of added edges increases.

【基金】 supported by the National Natural Science Foundation of China (Grant Nos 10832006 and 60674093);the Foundation for Key Program of Educational Ministry,China (Grant No 107110);the City University of Hong Kong under the Research Enhancement Scheme and SRG (Grant No 9041335)
  • 【文献出处】 Chinese Physics B ,中国物理B , 编辑部邮箱 ,2009年08期
  • 【分类号】O157.5;O231
  • 【被引频次】1
  • 【下载频次】24
节点文献中: 

本文链接的文献网络图示:

本文的引文网络