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 条
  • [21] Limited inhibition of multiple nodes in a driver network blocks metastasis
    Yesilkanal, Ali Ekrem
    Yang, Dongbo
    Valdespino, Andrea
    Tiwari, Payal
    Sabino, Alan U.
    Nguyen, Long Chi
    Lee, Jiyoung
    Xie, Xiao-He
    Sun, Siqi
    Dann, Christopher
    Robinson-Mailman, Lydia
    Steinberg, Ethan
    Stuhlmiller, Timothy
    Frankenberger, Casey
    Goldsmith, Elizabeth
    Johnson, Gary L.
    Ramos, Alexandre F.
    Rosner, Marsha R.
    ELIFE, 2021, 10
  • [22] Characterization of Driver Nodes: Network of Discrete-Time Agents
    Mahia, Ram Niwash
    Singh, Mahaveer
    Fulwani, Deepak M.
    2015 EUROPEAN CONTROL CONFERENCE (ECC), 2015, : 622 - 627
  • [23] Effect of network topology on the controllability of voter model dynamics using biased nodes
    Srinivasan, Aravinda R.
    Chakraborty, Subhadeep
    2014 AMERICAN CONTROL CONFERENCE (ACC), 2014,
  • [24] Controllability Scores for Selecting Control Nodes of Large-Scale Network Systems
    Sato, Kazuhiro
    Terasaki, Shun
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2024, 69 (07) : 4673 - 4680
  • [25] A Classification of Nodes for Structural Controllability
    Commault, Christian
    van der Woude, Jacob
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2019, 64 (09) : 3877 - 3882
  • [26] Security-Aware Network Analysis for Network Controllability
    Zhang, Shuo
    Wolthusen, Stephen D.
    2018 32ND INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS WORKSHOPS (WAINA), 2018, : 508 - 514
  • [27] Controllability Analysis of Networks Through Their Topologies
    Mousavi, Shima Sadat
    Haeri, Mohammad
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 4346 - 4351
  • [28] Mathematical Modeling of Network Nodes and Topologies of Modern Data Networks
    Antonova, V. M.
    Buzhin, I. G.
    Gnezdilov, V. S.
    Grechishkina, N. A.
    Kuznetsov, N. A.
    Mironov, Yu. B.
    JOURNAL OF COMMUNICATIONS TECHNOLOGY AND ELECTRONICS, 2024, : 46 - 51
  • [29] Structural controllability and time-to-control of directed scale-free networks with minimum number of driver nodes
    Imae, Takanobu
    Cai, Kai
    SYSTEMS & CONTROL LETTERS, 2021, 156
  • [30] Network Controllability Is Determined by the Density of Low In-Degree and Out-Degree Nodes
    Menichetti, Giulia
    Dall'Asta, Luca
    Bianconi, Ginestra
    PHYSICAL REVIEW LETTERS, 2014, 113 (07)