TY - JOUR
T1 - Optimal shattering of complex networks
AU - Balashov, Nicole
AU - Cohen, Reuven
AU - Haber, Avieli
AU - Krivelevich, Michael
AU - Haber, Simi
N1 - Publisher Copyright:
© 2019, The Author(s).
PY - 2019/12/1
Y1 - 2019/12/1
N2 - 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.
AB - 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.
KW - Random graphs
KW - Shattering
UR - http://www.scopus.com/inward/record.url?scp=85074680636&partnerID=8YFLogxK
U2 - 10.1007/s41109-019-0205-5
DO - 10.1007/s41109-019-0205-5
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
SN - 2364-8228
VL - 4
JO - Applied Network Science
JF - Applied Network Science
IS - 1
M1 - 99
ER -