HackerPapers

arXiv:2008.04414physics.soc-ph

A Framework of Hierarchical Attacks to Network Controllability

Yang Lou, Lin Wang, Guanrong Chen

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

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.

arXiv comments
10 pages,10 figures
Journal reference
Communications in Nonlinear Science and Numerical Simulation, 98:105780, 2021
DOI
doi:10.1016/j.cnsns.2021.105780
Subjects
physics.soc-phPhysics and Society eess.SYSystems and Control (EESS)

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from Aug 2020 to Aug 2020. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.