A Mathematical Analysis of Network Controllability Through Driver Nodes

被引:5
|
作者
Chin S.P. [1 ,2 ]
Cohen J. [3 ]
Albin A. [3 ]
Hayvanovych M. [3 ]
Reilly E. [3 ]
Brown G. [1 ]
Harer J. [1 ]
机构
[1] Department of Computer Science, Boston University, Boston, 02215, MA
[2] Systems and Technology Research, Woburn, 01801, MA
[3] Johns Hopkins University Applied Physics Laboratory, Laurel, 20723, MD
关键词
Controllability; maximal matching; social network;
D O I
10.1109/TCSS.2017.2698725
中图分类号
学科分类号
摘要
A May 2011 Nature article by Liu, Slotine, and Barabasi laid a mathematical foundation for analyzing network controllability of self-organizing networks and how to identify the minimum number of nodes needed to control a network, or driver nodes. In this paper, we continue to explore this topic, beginning with a look at how Laplacian eigenvalues relate to the percentage of nodes required to control a network. Next, we define and analyze super driver nodes, or those driver nodes that survive graph randomization. Finally, we examine node properties to differentiate super driver nodes from other types of nodes in a graph. © 2014 IEEE.
引用
收藏
页码:40 / 51
页数:11
相关论文
共 50 条
  • [1] Identifying Driver Nodes in the Human Signaling Network Using Structural Controllability Analysis
    Liu, Xueming
    Pan, Linqiang
    IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2015, 12 (02) : 467 - 472
  • [2] Driver Edges Analysis for Network Controllability
    Pang Shaopeng
    Hao Fei
    2015 34TH CHINESE CONTROL CONFERENCE (CCC), 2015, : 7291 - 7296
  • [3] Optimizing Driver Nodes for Structural Controllability of Temporal Networks
    Srighakollapu, Manikya Valli
    Kalaimani, Rachel Kalpana
    Pasumarthy, Ramkrishna
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2022, 9 (01): : 380 - 389
  • [4] Eliminating Redundant Driver Nodes with Structural Controllability Guarantee
    Huang, Wenzhen
    Xi, Yugeng
    Xu, Yuli
    Gan, Zhongxue
    PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 347 - 352
  • [5] Driver-Node based Security Analysis for Network Controllability
    Zhang, Shuo
    Wolthusen, Stephen D.
    2019 18TH EUROPEAN CONTROL CONFERENCE (ECC), 2019, : 2246 - 2251
  • [6] Deducing Complete Selection Rule Set for Driver Nodes to Guarantee Network's Structural Controllability
    Xichen Wang
    Yugeng Xi
    Wenzhen Huang
    Shuai Jia
    IEEE/CAA Journal of Automatica Sinica, 2019, 6 (05) : 1152 - 1165
  • [7] Deducing Complete Selection Rule Set for Driver Nodes to Guarantee Network's Structural Controllability
    Wang, Xichen
    Xi, Yugeng
    Huang, Wenzhen
    Jia, Shuai
    IEEE-CAA JOURNAL OF AUTOMATICA SINICA, 2019, 6 (05) : 1152 - 1165
  • [8] A research on driver nodes identification in Chinese interbank networks: based on the controllability theory of complex network
    Zhi, Yong
    Ouyang, Hongbing
    Xue, Man
    APPLIED ECONOMICS LETTERS, 2022, 29 (06) : 495 - 501
  • [9] How Centrality of Driver Nodes Affects Controllability of Complex Networks
    Song, Guang-Hua
    Li, Xin-Feng
    Lu, Zhe-Ming
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2021, E104D (08) : 1340 - 1348
  • [10] Structural Controllability of Multiplex Networks With the Minimum Number of Driver Nodes
    Li, Xiang
    Li, Guoqi
    Gao, Leitao
    Chew, Lock Yue
    Xiao, Gaoxi
    IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, 2024, 11 (04): : 2088 - 2100