Robustness of network controllability to degree-based edge attacks

Jijju Thomas, Supratim Ghosh, Deven Parek, Derek Ruths, Justin Ruths

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

6 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationComplex Networks & Their Applications V
PublisherSpringer
Pages525-537
Number of pages13
Volume693
DOIs
Publication statusPublished - 30 Nov 2016
Externally publishedYes
EventComplex networks 2016

- Milan, Italy
Duration: 30 Nov 20162 Dec 2016

Publication series

NameStudies in Computational Intelligence
PublisherSpringer
Volume693
ISSN (Print)1860-949X

Conference

ConferenceComplex networks 2016

Country/TerritoryItaly
CityMilan
Period30/11/162/12/16

Fingerprint

Dive into the research topics of 'Robustness of network controllability to degree-based edge attacks'. Together they form a unique fingerprint.

Cite this