Optimal shattering of complex networks release_ddushnurgbagpbfiv4xrna2sbu

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

Released as a article .



We consider optimal attacks or immunization schemes on different models of random graphs. We derive bounds for the minimum number of nodes needed to be removed from a network such that all remaining components are fragments of negligible size. We obtain bounds for different regimes of random regular graphs, Erdős-Rényi random graphs, and scale free networks, some of which are tight. We show that the performance of attacks by degree is bounded away from optimality. Finally we present a polynomial time attack algorithm and prove its optimal performance in certain cases.
In text/plain format

Archived Files and Locations

application/pdf  316.9 kB
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-12-05
Version   v1
Language   en ?
arXiv  1912.04044v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 96894428-5982-4370-b728-80dae49579fa