Robustness of preferential-attachment graphs

Abstract The widely used characterization of scale-free networks as “robust-yet-fragile” originates primarily from experiments on instances generated by preferential attachment. According to this characterization, scale-free networks are more robust against random failures but more fragile against t...

Full description

Bibliographic Details
Main Authors: Rouzbeh Hasheminezhad, Ulrik Brandes
Format: Article
Language:English
Published: SpringerOpen 2023-06-01
Series:Applied Network Science
Subjects:
Online Access:https://doi.org/10.1007/s41109-023-00556-5