Please wait a minute...
Chin. Phys. B, 2009, Vol. 18(8): 3122-3130    DOI: 10.1088/1674-1056/18/8/004
GENERAL Prev   Next  

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

Duan Zhi-Sheng(段志生)a)†, Wang Wen-Xu(王文旭)b), Liu Chao(刘超)a), and Chen Guan-Rong(陈关荣)a)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
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.
Keywords:  complex network      complementary graph      synchronizability      edge addition  
Received:  15 September 2008      Revised:  25 November 2008      Accepted manuscript online: 
PACS:  89.75.Hc (Networks and genealogical trees)  
  02.10.Ox (Combinatorics; graph theory)  
  05.45.Xt (Synchronization; coupled oscillators)  
Fund: Project 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) and the City University of Hong Kong under the Research Enhancement Scheme and SRG (Grant No 9041335).

Cite this article: 

Duan Zhi-Sheng(段志生), Wang Wen-Xu(王文旭), Liu Chao(刘超), and Chen Guan-Rong(陈关荣) Are networks with more edges easier to synchronize, or not? 2009 Chin. Phys. B 18 3122

[1] Analysis of cut vertex in the control of complex networks
Jie Zhou(周洁), Cheng Yuan(袁诚), Zu-Yu Qian(钱祖燏), Bing-Hong Wang(汪秉宏), and Sen Nie(聂森). Chin. Phys. B, 2023, 32(2): 028902.
[2] Vertex centrality of complex networks based on joint nonnegative matrix factorization and graph embedding
Pengli Lu(卢鹏丽) and Wei Chen(陈玮). Chin. Phys. B, 2023, 32(1): 018903.
[3] Effect of observation time on source identification of diffusion in complex networks
Chaoyi Shi(史朝义), Qi Zhang(张琦), and Tianguang Chu(楚天广). Chin. Phys. B, 2022, 31(7): 070203.
[4] An extended improved global structure model for influential node identification in complex networks
Jing-Cheng Zhu(朱敬成) and Lun-Wen Wang(王伦文). Chin. Phys. B, 2022, 31(6): 068904.
[5] Characteristics of vapor based on complex networks in China
Ai-Xia Feng(冯爱霞), Qi-Guang Wang(王启光), Shi-Xuan Zhang(张世轩), Takeshi Enomoto(榎本刚), Zhi-Qiang Gong(龚志强), Ying-Ying Hu(胡莹莹), and Guo-Lin Feng(封国林). Chin. Phys. B, 2022, 31(4): 049201.
[6] Robust H state estimation for a class of complex networks with dynamic event-triggered scheme against hybrid attacks
Yahan Deng(邓雅瀚), Zhongkai Mo(莫中凯), and Hongqian Lu(陆宏谦). Chin. Phys. B, 2022, 31(2): 020503.
[7] Explosive synchronization: From synthetic to real-world networks
Atiyeh Bayani, Sajad Jafari, and Hamed Azarnoush. Chin. Phys. B, 2022, 31(2): 020504.
[8] Finite-time synchronization of uncertain fractional-order multi-weighted complex networks with external disturbances via adaptive quantized control
Hongwei Zhang(张红伟), Ran Cheng(程然), and Dawei Ding(丁大为). Chin. Phys. B, 2022, 31(10): 100504.
[9] Explosive synchronization in a mobile network in the presence of a positive feedback mechanism
Dong-Jie Qian(钱冬杰). Chin. Phys. B, 2022, 31(1): 010503.
[10] LCH: A local clustering H-index centrality measure for identifying and ranking influential nodes in complex networks
Gui-Qiong Xu(徐桂琼), Lei Meng(孟蕾), Deng-Qin Tu(涂登琴), and Ping-Le Yang(杨平乐). Chin. Phys. B, 2021, 30(8): 088901.
[11] Complex network perspective on modelling chaotic systems via machine learning
Tong-Feng Weng(翁同峰), Xin-Xin Cao(曹欣欣), and Hui-Jie Yang(杨会杰). Chin. Phys. B, 2021, 30(6): 060506.
[12] Dynamical robustness of networks based on betweenness against multi-node attack
Zi-Wei Yuan(袁紫薇), Chang-Chun Lv(吕长春), Shu-Bin Si(司书宾), and Dong-Li Duan(段东立). Chin. Phys. B, 2021, 30(5): 050501.
[13] Exploring individuals' effective preventive measures against epidemics through reinforcement learning
Ya-Peng Cui(崔亚鹏), Shun-Jiang Ni (倪顺江), and Shi-Fei Shen(申世飞). Chin. Phys. B, 2021, 30(4): 048901.
[14] Improving robustness of complex networks by a new capacity allocation strategy
Jun Liu(刘军). Chin. Phys. B, 2021, 30(1): 016401.
[15] Manufacturing enterprise collaboration network: An empirical research and evolutionary model
Ji-Wei Hu(胡辑伟), Song Gao(高松), Jun-Wei Yan(严俊伟), Ping Lou(娄平), Yong Yin(尹勇). Chin. Phys. B, 2020, 29(8): 088901.
No Suggested Reading articles found!