Improving the Controllability of Complex Networks by Temporal Segmentation

被引:5
|
作者
Cui, Yulong [1 ]
He, Shibo [1 ,2 ]
Wu, Mincheng [1 ]
Zhou, Chengwei [1 ]
Chen, Jiming [1 ,2 ]
机构
[1] Zhejiang Univ, State Key Lab Ind Control Technol, Hangzhou 310027, Peoples R China
[2] Alibaba Zhejiang Univ Joint Res Inst Frontier Tec, Hangzhou 310027, Peoples R China
基金
中国国家自然科学基金;
关键词
Controllability; Complex networks; Switches; Directed graphs; Nonlinear dynamical systems; Directed acyclic graph; complex networks; temporal network; structural controllability; STRUCTURAL CONTROLLABILITY; ASSIGNMENT;
D O I
10.1109/TNSE.2020.2991056
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Controllability is a fundamental issue in complex networks. Though previous studies showed that the network structure has a great impact on the least number of driver nodes to control the whole network, it is still an open issue to optimize the controllability of complex networks based solely on the network structure for a given number of driver nodes. In this paper, we try to address this problem from the perspective of temporal segmentation, i.e., transform a static complex network into a temporal network consisting of a collection of networks with time stamps. With the advantage of temporal network, the controllability of the original network will be improved without adding more driver nodes. The challenge lies in how to decide a segmentation scheme and guarantee its optimality. To address this, we proposed a cactus-based segmentation scheme, which transforms the original network into a cactus-shaped networks at different snapshots. As the last snapshot elapses, the controllability of the original network will be achieved. We also proved that the segmentation approach is the best option, i.e., the least number of obtained snapshots is no larger than any other segmentation approaches. When the network contains no loops, we reduce the problem to the minimum path covering problem and devise an optimal segmentation scheme. For an arbitrary directed graph, the lower bound of the smallest segmentation can also be theoretically obtained. Finally, the performance of proposed algorithms is discussed and a simple illustration is provided to validate our results.
引用
收藏
页码:2765 / 2774
页数:10
相关论文
共 50 条
  • [1] Improving the controllability robustness of complex temporal networks against intelligent attacks
    Zhang, Qian
    Arebi, Peyman
    [J]. JOURNAL OF COMPLEX NETWORKS, 2024, 12 (04)
  • [2] On the structural controllability of temporal complex networks
    Pan, Yujian
    Li, Xiang
    [J]. Complex Systems and Complexity Science, 2015, 12 (02) : 23 - 31
  • [3] Improving the efficiency of network controllability processes on temporal networks
    Li, Fang
    [J]. JOURNAL OF KING SAUD UNIVERSITY-COMPUTER AND INFORMATION SCIENCES, 2024, 36 (03)
  • [4] Improving Controllability of Complex Networks by Rewiring Links Regularly
    Xu, Jiuqiang
    Wang, Jinfa
    Zhao, Hai
    Jia, Siyuan
    [J]. 26TH CHINESE CONTROL AND DECISION CONFERENCE (2014 CCDC), 2014, : 642 - 645
  • [5] A novel controllability method on complex temporal networks based on temporal motifs
    Jin, Yan
    Arebi, Peyman
    [J]. Concurrency and Computation: Practice and Experience, 2024, 36 (27)
  • [6] On controllability of temporal networks
    Lebon, Luca Claude Gino
    Lo Iudice, Francesco
    Altafini, Claudio
    [J]. European Journal of Control, 2024, 80
  • [7] Novel network representation model for improving controllability processes on temporal networks
    Liu, Yan
    Zeng, Jianhang
    Xu, Yue
    [J]. JOURNAL OF COMPLEX NETWORKS, 2023, 11 (05)
  • [8] Controllability of complex networks
    Liu, Yang-Yu
    Slotine, Jean-Jacques
    Barabasi, Albert-Laszlo
    [J]. NATURE, 2011, 473 (7346) : 167 - 173
  • [9] Controllability of complex networks
    Yang-Yu Liu
    Jean-Jacques Slotine
    Albert-László Barabási
    [J]. Nature, 2011, 473 : 167 - 173
  • [10] Structural controllability of temporal networks
    Posfai, Marton
    Hoevel, Philipp
    [J]. NEW JOURNAL OF PHYSICS, 2014, 16