Abstract
This paper presents machine learning based approximations for the minimum number of driver nodes needed for structural controllability of networks under link-based random and targeted attacks. We compare our approximations with existing analytical approximations and show that our machine learning based approximations significantly outperform the existing closed-form analytical approximations in case of both synthetic and real-world networks. Apart from targeted attacks based upon the removal of so-called critical links, we also propose analytical approximations for out-in degree-based attacks.
Original language | English |
---|---|
Title of host publication | Machine Learning for Networking - Third International Conference, MLN 2020, Revised Selected Papers |
Editors | Éric Renault, Selma Boumerdassi, Paul Mühlethaler |
Publisher | Springer |
Pages | 19-39 |
Number of pages | 21 |
ISBN (Print) | 9783030708658 |
DOIs | |
Publication status | Published - 2021 |
Event | 3rd International Conference on Machine Learning for Networking, MLN 2020 - Paris, France Duration: 24 Nov 2020 → 26 Nov 2020 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 12629 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 3rd International Conference on Machine Learning for Networking, MLN 2020 |
---|---|
Country/Territory | France |
City | Paris |
Period | 24/11/20 → 26/11/20 |
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-careOtherwise 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
- Driver nodes
- Machine learning
- Network controllability
- Network robustness