Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Framework of Hierarchical Attacks to Network Controllability

Published 4 Aug 2020 in physics.soc-ph, cs.SY, and eess.SY | (2008.04414v1)

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 better understand the network controllability and better design robust networks.

Citations (24)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.