Optimal shattering of complex networks

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

doi:10.1007/s41109-019-0205-5

Optimal shattering of complex networks

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

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

Abstract

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.

Original language	English
Article number	99
Journal	Applied Network Science
Volume	4
Issue number	1
DOIs	https://doi.org/10.1007/s41109-019-0205-5
State	Published - 1 Dec 2019

Bibliographical note

Publisher Copyright:
© 2019, The Author(s).

Funding

MK was partially supported by USA-Israel BSF grant 2014361, and by ISF grant 1261/17. This work was supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Directorate in the Prime Minister’s office.

Funders	Funder number
Israel National Directorate
USA-Israel BSF	2014361
Israel Science Foundation	1261/17
Center for Research in Applied Cryptography and Cyber Security, Bar-Ilan University

Keywords

Random graphs
Shattering

Access to Document

10.1007/s41109-019-0205-5

Cite this

@article{df2a93d5151a431ab7fb4fe191ea98ef,

title = "Optimal shattering of complex networks",

abstract = "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{\H o}s-R{\'e}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.",

keywords = "Random graphs, Shattering",

author = "Nicole Balashov and Reuven Cohen and Avieli Haber and Michael Krivelevich and Simi Haber",

note = "Publisher Copyright: {\textcopyright} 2019, The Author(s).",

year = "2019",

month = dec,

day = "1",

doi = "10.1007/s41109-019-0205-5",

language = "אנגלית",

volume = "4",

journal = "Applied Network Science",

issn = "2364-8228",

publisher = "Springer Nature",

number = "1",

}

TY - JOUR

T1 - Optimal shattering of complex networks

AU - Balashov, Nicole

AU - Cohen, Reuven

AU - Haber, Avieli

AU - Krivelevich, Michael

AU - Haber, Simi

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 - https://www.scopus.com/pages/publications/85074680636

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 -

Optimal shattering of complex networks

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this