Robustness of network controllability to degree-based edge attacks

8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We analyze the tolerance of network controllability to degree-based edge attacks as well as random edge failure. In particular, we leverage both control-based and reachability-based robustness metrics to investigate the case when a fixed number of controls are allowed to change locations following each attack. This ability to change the locations of controls models the more realistic scenario in which operators may have a fixed budget of resources but that these resources can be redeployed in response to attacks on the system. We also identify that the most potent targeted attack for network controllability selects edges (on average) based on betweenness centrality.

Cite

CITATION STYLE

APA

Thomas, J., Ghosh, S., Parek, D., Ruths, D., & Ruths, J. (2017). Robustness of network controllability to degree-based edge attacks. Studies in Computational Intelligence, 693, 525–537. https://doi.org/10.1007/978-3-319-50901-3_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free