Robustness of Network Controllability with Respect to Node Removals
conference paper
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. (C) 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.
TNO Identifier
984363
ISSN
1860949X
ISBN
9783031211300
Publisher
Springer Science and Business Media Deutschland GmbH
Source title
Studies in Computational Intelligence
Editor(s)
Cherifi H.Mantegna R.N.Rocha L.M.Cherifi C.Micciche S.
Pages
383-394
Files
To receive the publication files, please send an e-mail request to TNO Repository.