Robustness of Network Controllability with Respect to Node Removals Based on In-Degree and Out-Degree

Fenghua Wang*, Robert E. Kooij

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

19 Downloads (Pure)

Abstract

Network controllability and its robustness have been widely studied. However, analytical methods to calculate network controllability with respect to node in- and out-degree targeted removals are currently lacking. This paper develops methods, based on generating functions for the in- and out-degree distributions, to approximate the minimum number of driver nodes needed to control directed networks, during node in- and out-degree targeted removals. By validating the proposed methods on synthetic and real-world networks, we show that our methods work reasonably well. Moreover, when the fraction of the removed nodes is below 10% the analytical results of random removals can also be used to predict the results of targeted node removals.
Original languageEnglish
Article number656
Number of pages20
JournalEntropy: international and interdisciplinary journal of entropy and information studies
Volume25
Issue number4
DOIs
Publication statusPublished - 2023

Keywords

  • controllability
  • complex networks
  • node removals

Fingerprint

Dive into the research topics of 'Robustness of Network Controllability with Respect to Node Removals Based on In-Degree and Out-Degree'. Together they form a unique fingerprint.

Cite this