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 条
  • [1] Analysis of cut vertex in the control of complex networks
    周洁
    袁诚
    钱祖燏
    汪秉宏
    聂森
    Chinese Physics B, 2023, 32 (02) : 669 - 674
  • [2] Analysis on damage measure of vertex importance in complex networks
    Wang, Hui
    Zhao, Wen-Hui
    Shi, Quan
    Nanjing Li Gong Daxue Xuebao/Journal of Nanjing University of Science and Technology, 2012, 36 (06): : 926 - 931
  • [3] Localization of eigenvector centrality in networks with a cut vertex
    Sharkey, Kieran J.
    PHYSICAL REVIEW E, 2019, 99 (01)
  • [4] Finding a Small Vertex Cut on Distributed Networks
    Jiang, Yonggang
    Mukhopadhyay, Sagnik
    PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023, 2023, : 1791 - 1801
  • [5] A step forward to pinning control of complex networks: finding an optimal vertex to control
    Yu, Wenwu
    Lu, Jinhu
    Yu, Xinghuo
    Chen, Guanrong
    2013 9TH ASIAN CONTROL CONFERENCE (ASCC), 2013,
  • [6] VERTEX COVER IN COMPLEX NETWORKS
    Da Silva, Mariana O.
    Gimenez-Lugo, Gustavo A.
    Da Silva, Murilo V. G.
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2013, 24 (11):
  • [7] Vertex cut of a graph and connectivity of its neighbourhood complex
    Santhanam, Rekha
    Shukla, Samir
    DISCRETE MATHEMATICS, 2023, 346 (08)
  • [8] VERTEX ANALYSIS OF NETWORKS
    BERRY, M
    JOURNAL OF ANATOMY, 1981, 133 (DEC) : 689 - 690
  • [9] VERTEX CONTROL OF FLOWS IN NETWORKS
    Engel, Klaus-Jochen
    Fijavz, Marjeta Kramar
    Nagel, Rainer
    Sikolya, Eszter
    NETWORKS AND HETEROGENEOUS MEDIA, 2008, 3 (04) : 709 - 722
  • [10] THE VERTEX ATTACK TOLERANCE OF COMPLEX NETWORKS
    Matta, John
    Ercal, Gunes
    Borwey, Jeffrey
    RAIRO-OPERATIONS RESEARCH, 2017, 51 (04) : 1055 - 1076