Robustness analysis of network controllability

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. H...

Full description

Saved in:
Bibliographic Details
Published in:Physica A 2012-09, Vol.391 (18), p.4420-4425
Main Authors: Pu, Cun-Lai, Pei, Wen-Jiang, Michaelson, Andrew
Format: Article
Language:English
Subjects:
Algorithms
Cascade control
Cascade failure
Controllability
Drivers
Failure
Network controllability
Networks
Robustness
Statistical mechanics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 Erdös–Rényi 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. ► We study the robustness of network controllability for directed complex networks. ► Degree-based attacks are efficient on network structural controllability. ► Cascade failures also do great harm to network controllability.
ISSN:0378-4371
1873-2119
DOI:10.1016/j.physa.2012.04.019