Robustness of network controllability to degree-based edge attacks

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

doi:10.1007/978-3-319-50901-3_42

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 proceeding › Conference contribution › Academic › peer-review

9 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 language	English
Title of host publication	Complex Networks & Their Applications V
Publisher	Springer
Pages	525-537
Number of pages	13
Volume	693
DOIs	https://doi.org/10.1007/978-3-319-50901-3_42
Publication status	Published - 30 Nov 2016
Externally published	Yes
Event	Complex networks 2016 - Milan, Italy Duration: 30 Nov 2016 → 2 Dec 2016

Publication series

Name	Studies in Computational Intelligence
Publisher	Springer
Volume	693
ISSN (Print)	1860-949X

Conference

Conference	Complex networks 2016
Country/Territory	Italy
City	Milan
Period	30/11/16 → 2/12/16

Access to Document

10.1007/978-3-319-50901-3_42

Cite this

@inproceedings{c6f8cd6059664968a54961ae438cb410,

title = "Robustness of network controllability to degree-based edge attacks",

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.",

author = "Jijju Thomas and Supratim Ghosh and Deven Parek and Derek Ruths and Justin Ruths",

year = "2016",

month = nov,

day = "30",

doi = "10.1007/978-3-319-50901-3_42",

language = "English",

volume = "693",

series = "Studies in Computational Intelligence",

publisher = "Springer",

pages = "525--537",

booktitle = "Complex Networks & Their Applications V",

address = "Germany",

note = "Complex networks 2016 <br/><br/> ; Conference date: 30-11-2016 Through 02-12-2016",

}

TY - GEN

T1 - Robustness of network controllability to degree-based edge attacks

AU - Thomas, Jijju

AU - Ghosh, Supratim

AU - Parek, Deven

AU - Ruths, Derek

AU - Ruths, Justin

PY - 2016/11/30

Y1 - 2016/11/30

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85007401405&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-50901-3_42

DO - 10.1007/978-3-319-50901-3_42

M3 - Conference contribution

AN - SCOPUS:85007401405

VL - 693

T3 - Studies in Computational Intelligence

SP - 525

EP - 537

BT - Complex Networks & Their Applications V

PB - Springer

T2 - Complex networks 2016 <br/><br/>

Y2 - 30 November 2016 through 2 December 2016

ER -

Robustness of network controllability to degree-based edge attacks

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this