Effect of the interdependence between subnets on the structural controllability of complex networks

被引:2
|
作者
Yang, Yong [1 ,4 ]
Tu, Lilan [2 ,3 ]
Chai, Lang [2 ,3 ]
Guo, Tianjiao [2 ,3 ]
机构
[1] Henan Univ Anim Husb & Econ, Coll Sci, Zhengzhou, Peoples R China
[2] Wuhan Univ Sci & Technol, Hubei Prov Key Lab Syst Sci Met Proc, Wuhan, Peoples R China
[3] Wuhan Univ Sci & Technol, Coll Sci, Wuhan, Peoples R China
[4] Henan Univ Anim Husb & Econ, Coll Sci, Zhengzhou 450044, Peoples R China
关键词
complex network; interdependence; Kalman rank criterion; PBH rank criterion; structural controllability; OBSERVABILITY; NODES;
D O I
10.1002/asjc.3023
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Controllability is a hot issue in complex networks. In this paper, without changing the number and the positions of the controllers, the effect of interdependence (viz., inter-coupling relations) between two directed subnets that are controllable or uncontrollable on the structural controllability of complex networks is investigated. According to the Kalman rank criterion and PBH rank criterion, some sufficient conditions and necessary conditions for the structural controllability or uncontrollability of interdependent networks are presented. The results show that (1) if the uncontrollable and controllable nodes in one subnet are inter-coupled with the controllable and uncontrollable nodes in the other subnet, respectively, and the directions are from controllable nodes to the uncontrollable nodes, then the interdependent network may be controllable; (2) the interdependent network can be obtained structurally controllable if there are simply directed paths covering all the uncontrollable nodes of the two subnets, separately; and (3) the interdependent networks are structurally controllable no matter what kind of inter-couplings between two controllable subnets. All of these results are adaptive to undirected subnets. The final example verifies the effectiveness and correctness of the results provided in this paper.
引用
收藏
页码:3181 / 3191
页数:11
相关论文
共 50 条
  • [21] Studies on Strong Structural Controllability and Optimum Link Weight assignment of Complex Networks
    Roy, Dibyendu
    Maitra, Madhubanti
    2013 ANNUAL IEEE INDIA CONFERENCE (INDICON), 2013,
  • [22] Block-based minimum input design for the structural controllability of complex networks
    Bai, Ting
    Li, Shaoyuan
    Zou, Yuanyuan
    Yin, Xiang
    AUTOMATICA, 2019, 107 : 68 - 76
  • [23] Structural Controllability of Temporally Switching Networks
    Hou, Baoyu
    Li, Xiang
    Chen, Guanrong
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2016, 63 (10) : 1771 - 1781
  • [24] On quantitatively measuring controllability of complex networks
    Ning, Cai
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2017, 474 : 282 - 292
  • [25] An Index to Measure Controllability of Complex Networks
    Tan Zong-Yuan
    Cai Ning
    Diao Chen
    Guo Ling
    PROCEEDINGS OF THE 36TH CHINESE CONTROL CONFERENCE (CCC 2017), 2017, : 7797 - 7801
  • [26] Effect of degree correlations on controllability of undirected networks
    Xu Ming
    Xu Chuan-Yun
    Cao Ke-Fei
    ACTA PHYSICA SINICA, 2017, 66 (02)
  • [27] Functional Target Controllability of Networks: Structural Properties and Efficient Algorithms
    Commault, Christian
    van der Woude, Jacob
    Frasca, Paolo
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2020, 7 (03): : 1521 - 1530
  • [28] Structural controllability of dynamic transcriptional regulatory networks for Saccharomyces cerevisiae
    Liu, Suling
    Xu, Qiong
    Chen, Aimin
    Wang, Pei
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2020, 537
  • [29] Average Controllability of Complex Networks With Laplacian Dynamics
    Zhu, Jiawei
    Xiang, Linying
    Yu, Yanying
    Chen, Fei
    Chen, Guanrong
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2022, 69 (04) : 1704 - 1714
  • [30] Pinning control and controllability of complex dynamical networks
    Chen G.
    International Journal of Automation and Computing, 2017, 14 (1) : 1 - 9