The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In addition to their defining skewed degree distribution, the class of scale-free networks are generally described as robust-yet-fragile. This description suggests that, compared to random graphs of the same size, scale-free networks are more robust against random failures but more vulnerable to targeted attacks. Here, we report on experiments on a comprehensive collection of networks across different domains that assess the empirical prevalence of scale-free networks fitting this description. We find that robust-yet-fragile networks are a distinct minority, even among those networks that come closest to being classified as scale-free.

Cite

CITATION STYLE

APA

Hasheminezhad, R., Rønberg, A. B., & Brandes, U. (2023). The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks: An Empirical Analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13894 LNCS, pp. 99–111). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-32296-9_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free