Optimal shattering of complex networks

Balashov, Nicole; Cohen, Reuven; Haber, Avieli; Krivelevich, Michael; Haber, Simi

doi:10.1007/s41109-019-0205-5

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2023

Publication Types

Select...

Article1

Other1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Robustness of preferential-attachment graphs

Hasheminezhad

Brandes

2023

Appl Netw Sci

View full text Add to dashboard Cite

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 targeted attacks when compared to random networks of the same size. Here, we consider a more appropriate baseline by requiring that the random networks match not only the size but also the inherent minimum degree of preferential-attachment networks they are compared with. Under this more equitable condition, we can (1) prove that random networks are almost surely robust against any vertex removal strategy and (2) show through extensive experiments that scale-free networks generated by preferential attachment are not particularly robust against random failures. Finally, we (3) add experiments demonstrating that preferentially attaching to well-connected vertices does not enhance robustness at all.

show abstract