复杂网络均匀拓扑分割算法的结构能控性指数研究
Structural controllability index of uniform topological segmentation algorithm for complex networks
童鑫扬 1李晓丽1
作者信息
摘要
结构能控性指数K是网络系统达到能控状态的控制时间步长的衡量指标.为更好地均衡复杂网络系统的控制时间步长与控制成本,采用均匀拓扑分割的算法,选取合适驱动节点集,得到更低的结构能控性指数的同时,均衡网络的控制时间步长与控制成本.算法的可行性通过证明系统分割后的子系统的结构能控性指数是原网络结构能控性指数的上界关系进行验证.通过仿真与最大匹配算法对ER随机网络和真实网络进行其有效性对比,仿真结果表明:本文算法达到均衡网络控制时间步长与控制成本的效果.
Abstract
The structural controllability index K is a measure of the control time step for the network system to reach the controllable state.A uniform topological partitioning algorithm was used to select the appropriate set of driving nodes to obtain a lower structural controllability index while balancing the control time step and control cost of the network.The feasibility of the algorithm was verified by proving that the structural controllability index of the segmented subsystems of the system is the upper bound relation of the structural controllability index of the original network.The simulation results show that the algorithm achieves the effect of balancing the network control time step and control cost.
关键词
复杂网络/结构能控性/网络拓扑/分割Key words
complex network/structural controllability/network topology/segment引用本文复制引用
基金项目
上海市自然科学基金(16ZR1446700)
出版年
2024
NETL
NSTL
维普
万方数据