Network dismantling

Proceedings of the National Academy of Sciences of the United States of America

Volumn 113, Issue 44, 2016, Pages 12368-12373

  Braunstein, Alfredo ^a,b,c   Dall'Asta, Luca ^a,c   Semerjian, Guilhem ^d   Zdeborová, Lenka ^e  

^a POLITECNICO DI TORINO   (Italy)

^b Human Genetics Foundation   (Italy)

^c Center for Research on Pensions and Welfare Policies Collegio Carlo Alberto   (Italy)

^d ECOLE NORMALE SUPÉRIEURE   (France)

^e UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Graph fragmentation; Influence maximization; Message passing; Percolation; Random graphs

Indexed keywords

ALGORITHM; BUILDING; CONFERENCE PAPER; HEURISTICS; MECHANICS; NEIGHBORHOOD; PRIORITY JOURNAL; SOCIAL NETWORK;

EID: 84993990111     PISSN: 00278424     EISSN: 10916490     Source Type: Journal    
DOI: 10.1073/pnas.1605083113     Document Type: Article

References (27)

1. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwang DU (2006) Complex networks: Structure and dynamics. Phys Rep 424(4):175-308.
2. Barrat A, Barthelemy M, Vespignani A (2008) Dynamical Processes on Complex Networks (Cambridge Univ Press, Cambridge, UK).
3. Pastor-Satorras R, Vespignani A (2002) Immunization of complex networks. Phys Rev E Stat Nonlin Soft Matter Phys 65(3 Pt 2A):036104.
4. Cohen R, Havlin S, Ben-Avraham D (2003) Efficient immunization strategies for computer networks and populations. Phys Rev Lett 91(24):247901.
5. Britton T, Janson S, Martin-Löf A (2007) Graphs with specified degree distributions, simple epidemics, and local vaccination strategies. Adv Appl Probab 39(4):922-948.
6. Altarelli F, Braunstein A, Dall'Asta L, Wakeling JR, Zecchina R (2014) Containing epidemic outbreaks by message-passing techniques. Phys Rev X 4(2):021024.
7. Kempe D, Kleinberg J, Tardos E (2003) Maximizing the spread of influence through a social network. KDD 03:137-146.
8. Chen N (2008) On the approximability of influence in social networks. SODA 08: 1029-1037.
9. Dreyer PA, Jr, Roberts FS (2009) Irreversible k-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion. Discrete Appl Math 157(7): 1615-1627.
10. Janson S, Thomason A (2008) Dismantling sparse random graphs. Comb Probab Comput 17(02):259-264.
11. Bradonjic M, Molloy M, Yan G (2013) Containing viral spread on sparse random graphs: Bounds, algorithms, and experiments. Internet Math 9(4):406-433.
12. Edwards K, McDiarmid C (1994) New upper bounds on harmonious colorings. J Graph Theory 18(3):257-267.
13. Edwards K, Farr G (2001) Fragmentability of graphs. J Comb Theory Ser B 82(1):30-37.
14. Edwards K, Farr G (2008) Planarization and fragmentability of some classes of graphs. Discrete Math 308(12):2396-2406.
15. Morone F, Makse HA (2015) Influence maximization in complex networks through optimal percolation. Nature 524(7563):65-68.
16. Albert R, Jeong H, Barabási AL (2000) Error and attack tolerance of complex networks. Nature 406(6794):378-382.
17. Callaway DS, Newman MEJ, Strogatz SH, Watts DJ (2000) Network robustness and fragility: Percolation on random graphs. Phys Rev Lett 85(25):5468-5471.
18. Cohen R, Erez K, ben-Avraham D, Havlin S (2001) Breakdown of the internet under intentional attack. Phys Rev Lett 86(16):3682-3685.
19. Karp RM (1972) Reducibility among combinatorial problems. Complexity of Computer Computations, eds Miller RE, Thatcher JW, Bohlinger JD (Springer, Boston), pp 85-103.
20. Altarelli F, Braunstein A, Dall'Asta L, Zecchina R (2013) Large deviations of cascade processes on graphs. Phys Rev E Stat Nonlin Soft Matter Phys 87(6):062115.
21. Altarelli F, Braunstein A, Dall'Asta L, Zecchina R (2013) Optimizing spread dynamics on graphs by message passing. J Stat Mech 09:P09011.
22. Zhou HJ (2013) Spin glass approach to the feedback vertex set problem. Eur Phys J B 86(11):1-9.
23. Guggiola A, Semerjian G (2015) Minimal contagious sets in random regular graphs. J Stat Phys 158(2):300-358.
24. Mugisha S, Zhou HJ (2016) Identifying optimal targets of network attack by belief propagation. Phys Rev E Stat Nonlin Soft Matter Phys 94(1-1):012305.
25. Mézard M, Parisi G (2001) The Bethe lattice spin glass revisited. Eur Phys J B 20:217-233.
26. Mézard M, Montanari A (2009) Information, Physics and Computation (Oxford Univ Press, London).
27. Leskovec J, Krevl A (2014) SNAP Datasets: Stanford Large Network Dataset Collection. Available at snap.stanford.edu/data. Accessed September 30, 2015.