A Framework of Hierarchical Attacks to Network Controllability
Yang Lou, Lin Wang, Guanrong Chen

TL;DR
This paper introduces a hierarchical attack framework targeting network controllability, classifying edges and nodes by importance to optimize destructive attacks, with implications for designing more robust networks.
Contribution
It proposes a novel hierarchical attack strategy based on edge and node importance, enhancing the understanding of network controllability robustness.
Findings
Hierarchical attack strategies effectively disrupt network controllability.
Critical edges and nodes are key targets for attack.
Hiding critical components can improve network robustness.
Abstract
Network controllability robustness reflects how well a networked dynamical system can maintain its controllability against destructive attacks. This paper investigates the network controllability robustness from the perspective of a malicious attack. A framework of hierarchical attack is proposed, by means of edge- or node-removal attacks. Edges (or nodes) in a target network are classified hierarchically into categories, with different priorities to attack. The category of critical edges (or nodes) has the highest priority to be selected for attack. Extensive experiments on nine synthetic networks and nine real-world networks show the effectiveness of the proposed hierarchical attack strategies for destructing the network controllability. From the protection point of view, this study suggests that the critical edges and nodes should be hidden from the attackers. This finding helps…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
