Robustness of Network Controllability with Respect to Node Removals

Robustness of Network Controllability with Respect to Node Removals

Wang, F. (TU Delft Network Architectures and Services)
Kooij, Robert (DIANA FEA)

Cherifi, Hocine (editor)
Mantegna, Rosario Nunzio (editor)
Rocha, Luis M. (editor)
Cherifi, Chantal (editor)
Micciche, Salvatore (editor)

2023

Network controllability and its robustness has been widely studied. However, analytical methods to calculate network controllability with respect to node removals are currently lacking. This paper develops methods, based upon generating functions for the in- and out-degree distributions, to approximate the minimum number of driver nodes needed to control directed networks, during random and targeted node removals. By validating the proposed methods on synthetic and real-world networks, we show that our methods work very well in the case of random node removals and reasonably well in the case of targeted node removals, in particular for moderate fractions of attacked nodes.

Complex networks
Controllability
Node attacks
Node failures

http://resolver.tudelft.nl/uuid:25f83678-f36b-48e4-8a06-afaeabf5670d

https://doi.org/10.1007/978-3-031-21131-7_30

Springer, Cham

2023-07-26

978-3-031-21130-0

Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022—Volume 2

11th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2022, 2022-11-08 → 2022-11-10, Palermo, Italy

Studies in Computational Intelligence, 1860-949X, 1078

Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.

Institutional Repository

conference paper

© 2023 F. Wang, Robert Kooij