Robustness of network controllability under edge removal

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

Abstract

We introduce a quantitative measure of robustness of network controllability. Given a set of control nodes which drive the network, we investigate the effect of edge removal on the number of controllable nodes. We find that the mean degree of the network is a major factor in determining the robustness of random networks. Nonetheless, a comparison between real and random networks indicates a statistically significant difference which points to additional factors that influence the robustness of control of real complex networks. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Ruths, J., & Ruths, D. (2013). Robustness of network controllability under edge removal. Studies in Computational Intelligence, 476, 185–193. https://doi.org/10.1007/978-3-642-36844-8_18

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