Robustness of Network Controllability with Respect to Node Removals

Fenghua Wang; Robert Kooij

doi:10.1007/978-3-031-21131-7_30

Robustness of Network Controllability with Respect to Node Removals

^*Corresponding author for this work

Network Architectures and Services

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

1 Citation (Scopus)

13 Downloads (Pure)

Abstract

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.

Original language	English
Title of host publication	Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications
Subtitle of host publication	COMPLEX NETWORKS 2022—Volume 2
Editors	Hocine Cherifi, Rosario Nunzio Mantegna, Luis M. Rocha, Chantal Cherifi, Salvatore Micciche
Place of Publication	Cham
Publisher	Springer
Pages	383-394
Number of pages	12
ISBN (Electronic)	978-3-031-21131-7
ISBN (Print)	978-3-031-21130-0
DOIs	https://doi.org/10.1007/978-3-031-21131-7_30
Publication status	Published - 2023
Event	11th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2022 - Palermo, Italy Duration: 8 Nov 2022 → 10 Nov 2022

Publication series

Name	Studies in Computational Intelligence
Volume	1078
ISSN (Print)	1860-949X
ISSN (Electronic)	1860-9503

Conference

Conference	11th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2022
Country/Territory	Italy
City	Palermo
Period	8/11/22 → 10/11/22

Bibliographical note

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.

Keywords

Complex networks
Controllability
Node attacks
Node failures

Access to Document

10.1007/978-3-031-21131-7_30

978-3-031-21131-7_30Final published version, 472 KB

Cite this

Wang, F., & Kooij, R. (2023). Robustness of Network Controllability with Respect to Node Removals. In H. Cherifi, R. N. Mantegna, L. M. Rocha, C. Cherifi, & S. Micciche (Eds.), Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022—Volume 2 (pp. 383-394). (Studies in Computational Intelligence; Vol. 1078). Springer. https://doi.org/10.1007/978-3-031-21131-7_30

Wang, Fenghua ; Kooij, Robert. / Robustness of Network Controllability with Respect to Node Removals. Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022—Volume 2. editor / Hocine Cherifi ; Rosario Nunzio Mantegna ; Luis M. Rocha ; Chantal Cherifi ; Salvatore Micciche. Cham : Springer, 2023. pp. 383-394 (Studies in Computational Intelligence).

@inproceedings{25f83678f36b48e48a06afaeabf5670d,

title = "Robustness of Network Controllability with Respect to Node Removals",

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

keywords = "Complex networks, Controllability, Node attacks, Node failures",

author = "Fenghua Wang and Robert Kooij",

note = "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.; 11th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2022 ; Conference date: 08-11-2022 Through 10-11-2022",

year = "2023",

doi = "10.1007/978-3-031-21131-7_30",

language = "English",

isbn = "978-3-031-21130-0",

series = "Studies in Computational Intelligence",

publisher = "Springer",

pages = "383--394",

editor = "Hocine Cherifi and Mantegna, {Rosario Nunzio} and Rocha, {Luis M.} and Chantal Cherifi and Salvatore Micciche",

booktitle = "Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications",

}

Wang, F & Kooij, R 2023, Robustness of Network Controllability with Respect to Node Removals. in H Cherifi, RN Mantegna, LM Rocha, C Cherifi & S Micciche (eds), Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022—Volume 2. Studies in Computational Intelligence, vol. 1078, Springer, Cham, pp. 383-394, 11th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2022, Palermo, Italy, 8/11/22. https://doi.org/10.1007/978-3-031-21131-7_30

Robustness of Network Controllability with Respect to Node Removals. / Wang, Fenghua ; Kooij, Robert.
Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022—Volume 2. ed. / Hocine Cherifi; Rosario Nunzio Mantegna; Luis M. Rocha; Chantal Cherifi; Salvatore Micciche. Cham: Springer, 2023. p. 383-394 (Studies in Computational Intelligence; Vol. 1078).

Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Robustness of Network Controllability with Respect to Node Removals

AU - Wang, Fenghua

AU - Kooij, Robert

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

PY - 2023

Y1 - 2023

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

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

KW - Complex networks

KW - Controllability

KW - Node attacks

KW - Node failures

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

U2 - 10.1007/978-3-031-21131-7_30

DO - 10.1007/978-3-031-21131-7_30

M3 - Conference contribution

AN - SCOPUS:85149835933

SN - 978-3-031-21130-0

T3 - Studies in Computational Intelligence

SP - 383

EP - 394

BT - Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications

A2 - Cherifi, Hocine

A2 - Mantegna, Rosario Nunzio

A2 - Rocha, Luis M.

A2 - Cherifi, Chantal

A2 - Micciche, Salvatore

PB - Springer

CY - Cham

T2 - 11th International Conference on Complex Networks and their Applications, COMPLEX NETWORKS 2022

Y2 - 8 November 2022 through 10 November 2022

ER -

Wang F , Kooij R. Robustness of Network Controllability with Respect to Node Removals. In Cherifi H, Mantegna RN, Rocha LM, Cherifi C, Micciche S, editors, Complex Networks and Their Applications XI - Proceedings of The 11th International Conference on Complex Networks and Their Applications: COMPLEX NETWORKS 2022—Volume 2. Cham: Springer. 2023. p. 383-394. (Studies in Computational Intelligence). doi: 10.1007/978-3-031-21131-7_30