Analysis of cut vertex in the control of complex networks

被引:1
|
作者
Zhou, Jie [1 ]
Yuan, Cheng [1 ]
Qian, Zu-Yu [1 ]
Wang, Bing-Hong [2 ]
Nie, Sen [1 ]
机构
[1] East China Jiaotong Univ, Sch Elect & Automation Engn, Nanchang 330013, Peoples R China
[2] Univ Sci & Technol China, Dept Modern Phys, Hefei 230026, Peoples R China
基金
中国国家自然科学基金;
关键词
cut vertex; controllability; control energy; structural characteristic; complex networks; COMMUNITY;
D O I
10.1088/1674-1056/aca208
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
The control of complex networks is affected by their structural characteristic. As a type of key nodes in a network structure, cut vertexes are essential for network connectivity because their removal will disconnect the network. Despite their fundamental importance, the influence of the cut vertexes on network control is still uncertain. Here, we reveal the relationship between the cut vertexes and the driver nodes, and find that the driver nodes tend to avoid the cut vertexes. However, driving cut vertexes reduce the energy required for controlling complex networks, since cut vertexes are located near the middle of the control chains. By employing three different node failure strategies, we investigate the impact of cut vertexes failure on the energy required. The results show that cut vertex failures markedly increase the control energy because the cut vertexes are larger-degree nodes. Our results deepen the understanding of the structural characteristic in network control.
引用
收藏
页数:6
相关论文
共 50 条
  • [31] Cut-Vertex Independent Connectivity Maintaining Approach for Wireless Sensor and Actor Networks
    Zhao Xinyuan
    Wang Nene
    CHINA COMMUNICATIONS, 2015, 12 (02) : 19 - 28
  • [32] Cut-Vertex Independent Connectivity Maintaining Approach for Wireless Sensor and Actor Networks
    ZHAO Xinyuan
    WANG Neng
    China Communications, 2015, (S2) : 19 - 28
  • [33] An Energy-Efficient Distributed Cut Vertex Detection Algorithm for Wireless Sensor Networks
    Dagdeviren, Orhan
    Akram, Vahid Khalilpour
    COMPUTER JOURNAL, 2014, 57 (12): : 1852 - 1869
  • [34] Toward Scalable Cut Vertex and Link Detection with Applications in Wireless Ad Hoc Networks
    Stojmenovic, Ivan
    Simplot-Ryl, David
    Nayak, Amiya
    IEEE NETWORK, 2011, 25 (01): : 44 - 48
  • [35] Cut-Vertex Independent Connectivity Maintaining Approach for Wireless Sensor and Actor Networks
    ZHAO Xinyuan
    WANG Neng
    中国通信, 2015, 12(S2) (S2) : 19 - 28
  • [36] Cut vertex and cut edge problem for topological graph indices
    Gunes, Aysun Yurttas
    Togan, Muge
    Celik, Feriha
    Cangul, Ismail Naci
    JOURNAL OF TAIBAH UNIVERSITY FOR SCIENCE, 2019, 13 (01): : 1175 - 1183
  • [37] The vertex k-cut problem
    Cornaz, Denis
    Furini, Fabio
    Lacroix, Mathieu
    Malaguti, Enrico
    Mahjoub, A. Ridha
    Martin, Sebastien
    DISCRETE OPTIMIZATION, 2019, 31 : 8 - 28
  • [38] On Whitehead's cut vertex lemma
    Lyman, Rylee Alanza
    JOURNAL OF GROUP THEORY, 2023, 26 (04) : 665 - 675
  • [39] Distributed Vertex-Cut Partitioning
    Rahimian, Fatemeh
    Payberah, Amir H.
    Girdzijauskas, Sarunas
    Haridi, Seif
    DISTRIBUTED APPLICATIONS AND INTEROPERABLE SYSTEMS (DAIS 2014), 2014, 8460 : 186 - 200
  • [40] Stability analysis and decentralized control of a class of complex dynamical networks
    Duan, Zhisheng
    Wang, Jinzhi
    Chen, Guanrong
    Huang, Lin
    AUTOMATICA, 2008, 44 (04) : 1028 - 1035