Quantifying the Robustness of Network Controllability

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientific

10 Downloads (Pure)

Abstract

In this paper, we propose closed-form analytic approximations for the minimum number of driver nodes needed to fully control networks, where links are removed according to both random and targeted attacks. Our approximations rely on the concept of critical links. A link is called critical if its removal increases the required number of driver nodes. We validate our approximation on both real-world and synthetic networks. For random attacks, the approximation is always very good, as long as the fraction of removed links is smaller than the fraction of critical links. For some cases, the approximation is still accurate for larger fractions of removed links. The approximation for an attack, where first the critical links are removed, is also accurate, as long as the fraction of removed links is sufficiently small. Finally, we show that the critical link attack is the most effective among 4 considered attacks, as long as the fraction of removed links is smaller than the fraction of critical links.
Original languageEnglish
Title of host publication4th International Conference on System Reliability and Safety (ICSRS)
Subtitle of host publication20-22 November, Rome, Italy
Pages66-76
Number of pages11
ISBN (Electronic) 978-1-7281-4781-9
DOIs
Publication statusPublished - 2019
EventICRS 2019: 4th International Conference on System Reliability and Safety - Rome, Italy
Duration: 20 Nov 201922 Feb 2020
Conference number: 4

Conference

ConferenceICRS 2019: 4th International Conference on System Reliability and Safety
Abbreviated titleICRS 2019
CountryItaly
CityRome
Period20/11/1922/02/20

Fingerprint Dive into the research topics of 'Quantifying the Robustness of Network Controllability'. Together they form a unique fingerprint.

Cite this