Robustness analysis of network controllability
Robustness analysis of network controllability
复制标题
网络可控性鲁棒性分析
DOI：
10.1016/j.physa.2012.04.019
复制
发表时间：
2012-09-15
影响因子：
3.3
通讯作者：
Michaelson, Andrew
中科院分区：
文献类型：
--
作者：
Pu, Cun-Lai;Pei, Wen-Jiang;Michaelson, Andrew
结构能控性是复杂网络的一个有趣的性质，吸引了众多领域的研究者。最大匹配算法最近被应用于探索最小数量的驱动器节点，其中控制信号被注入，以控制整个网络。在这里，我们研究了有向Erdos-Renyi和无标度网络的攻击和级联故障下的可控性。结果表明，基于度的攻击比随机攻击更有效的网络结构可控性。即使是由局部节点故障触发的级联故障也会对网络的可控性造成很大的危害。(c)2012 Elsevier B. V.保留所有权利。
Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdos-Renyi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure. (c) 2012 Elsevier B.V. All rights reserved.