Identifying optimal targets of network attack by belief propagation

Physical Review E

Volumn 94, Issue 1, 2016, Pages

  Mugisha, Salomon ^a,b   Zhou, Hai Jun ^a,b  

^a INSTITUTE OF THEORETICAL PHYSICS   (China)

^b UNIVERSITY OF CHINESE ACADEMY OF SCIENCES   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; SPIN GLASS;

BELIEF PROPAGATION; BELIEF PROPAGATION GUIDED DECIMATIONS; FEEDBACK VERTEX SET PROBLEMS; INFORMATION ALGORITHMS; LINEAR TIME COMPLEXITY; REAL-WORLD NETWORKS; SMALL COMPONENTS; SPIN-GLASS THEORY;

COMPUTER CRIME;

EID: 84978198571     PISSN: 24700045     EISSN: 24700053     Source Type: Journal    
DOI: 10.1103/PhysRevE.94.012305     Document Type: Article

References (41)

1. D.-R. He, Z.-H. Liu, and B.-H. Wang, Complex Systems and Complex Networks (Higher Education Press, Beijing, 2009).
2. R. Albert and A.-L. Barabási, Statistical mechanics of complex networks, Rev. Mod. Phys. 74, 47 (2002). RMPHAT 0034-6861 10.1103/RevModPhys.74.47
3. R. Albert, H. Jeong, and A.-L. Barabási, Error and attack tolerance of complex networks, Nature 406, 378 (2000). NATUAS 0028-0836 10.1038/35019019
4. D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, Network Robustness and Fragility: Percolation on Random Graphs, Phys. Rev. Lett. 85, 5468 (2000). PRLTAO 0031-9007 10.1103/PhysRevLett.85.5468
5. R. Cohen, K. Erez, D. ben-Avraham, and S. Havlin, Breakdown of the Internet Under Intentional Attack, Phys. Rev. Lett. 86, 3682 (2001). PRLTAO 0031-9007 10.1103/PhysRevLett.86.3682
6. R. Pastor-Satorras and A. Vespignani, Epidemic Spreading in Scale-Free Networks, Phys. Rev. Lett. 86, 3200 (2001). PRLTAO 0031-9007 10.1103/PhysRevLett.86.3200
7. F. Altarelli, A. Braunstein, L. Dall'Asta, J. R. Wakeling, and R. Zecchina, Containing epidemic outbreaks by message-passing techniques, Phys. Rev. X 4, 021024 (2014). 10.1103/PhysRevX.4.021024
8. A. Guggiola and G. Semerjian, Minimal contagious sets in random regular graphs, J. Stat. Phys. 158, 300 (2015). JSTPBS 0022-4715 10.1007/s10955-014-1136-2
9. M. Richardson and P. Domingos, Mining knowledge-sharing sites for viral marketing, In Proceedings of 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (ACM, New York, NY, 2002), pp. 61-70.
10. D. Kempe, J. Kleinberg, and E. Tardos, Maximizing the spread of influence through a social network, Theor. Comput. 11, 105 (2015). 1557-2862 10.4086/toc.2015.v011a004
11. F. Altarelli, A. Braunstein, L. Dall'Asta, and R. Zecchina, Optimizing spread dynamics on graphs by message passing, J. Stat. Mech. (2013) P09011. 10.1088/1742-5468/2013/09/P09011
12. P. Bonacich, Power and centrality: A family of measures, Am. J. Sociol. 92, 1170 (1987). 0002-9602 10.1086/228631
13. P. Li, J. Zhang, X.-K. Xu, and M. Small, Dynamical influence of nodes revisited: A markov chain analysis of epidemic process on networks, Chin. Phys. Lett. 29, 048903 (2012). CPLEEU 0256-307X 10.1088/0256-307X/29/4/048903
14. E. Marinari and R. Monasson, Circuits in random graphs: from local trees to global loops, J. Stat. Mech. (2004) P09004. 10.1088/1742-5468/2004/09/P09004
15. E. Marinari, R. Monasson, and G. Semerjian, An algorithm for counting circuits: Application to real-world and random graphs, Europhys. Lett. 73, 8 (2005). EULEEJ 0295-5075 10.1209/epl/i2005-10355-0
16. G. Bianconi and M. Marsili, Loops of any size and hamilton cycles in random scale-free networks, J. Stat. Mech. (2005) P06005. 10.1088/1742-5468/2005/06/P06005
17. R. M. Karp, Reducibility among combinatorial problems, in Complexity of Computer Computations, edited by E. Miller, J. W. Thatcher, and J. D. Bohlinger (Plenum Press, New York, 1972), pp. 85-103.
18. H.-J. Zhou, Spin glass approach to the feedback vertex set problem, Eur. Phys. J. B 86, 455 (2013). EPJBFY 1434-6028 10.1140/epjb/e2013-40690-1
19. S. Bau, N. C. Wormald, and S. Zhou, Decycling numbers of random regular graphs, Random Struct. Alg. 21, 397 (2002). 1042-9832 10.1002/rsa.10069
20. S.-M. Qin and H.-J. Zhou, Solving the undirected feedback vertex set problem by local search, Eur. Phys. J. B 87, 273 (2014). EPJBFY 1434-6028 10.1140/epjb/e2014-50289-7
21. P. Galinier, E. Lemamou, and M. W. Bouzidi, Applying local search to the feedback vertex set problem, J. Heuristics 19, 797 (2013). 1381-1231 10.1007/s10732-013-9224-z
22. F. Morone and H. A. Makse, Influence maximization in complex networks through optimal percolation, Nature 524, 65 (2015). NATUAS 0028-0836 10.1038/nature14604
23. D. Achlioptas, R. M. D'Souza, and J. Spencer, Explosive percolation in random networks, Science 323, 1453 (2009). SCIEAS 0036-8075 10.1126/science.1167782
24. O. Riordan and L. Warnke, Explosive percolation is continuous, Science 333, 322 (2011). SCIEAS 0036-8075 10.1126/science.1206241
25. Y. S. Cho, S. Hwang, H. J. Herrmann, and B. Kahng, Avoiding a spanning cluster in percolation models, Science 339, 1185 (2013). SCIEAS 0036-8075 10.1126/science.1230813
26. K.-I. Goh, B. Kahng, and D. Kim, Universal Behavior of Load Distribution in Scale-Free Networks, Phys. Rev. Lett. 87, 278701 (2001). PRLTAO 0031-9007 10.1103/PhysRevLett.87.278701
27. L. Šubelj and M. Bajec, Robust network community detection using balanced propagation, Eur. Phys. J. B 81, 353 (2011). EPJBFY 1434-6028 10.1140/epjb/e2011-10979-2
28. J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney, Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters, Internet Math. 6, 29 (2009). 1542-7951 10.1080/15427951.2009.10129177
29. D. J. Watts and S. H. Strogatz, Collective dynamics of "small-world" netowrks, Nature 393, 440 (1998). NATUAS 0028-0836 10.1038/30918
30. J. Leskovec, J. Kleinberg, and C. Faloutsos, Graphs over time: densification laws, shrinking diameters and possible explanations, in Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining KDD'05 (ACM, New York, NY, 2005), pp. 177-187.
31. J. Leskovec, J. Kleinberg, and C. Faloutsos, Graph evolution: Densification and shrinking diameters, ACM Trans. Knowl. Discov. Data 1, 2 (2007). 1556-4681 10.1145/1217299.1217301
32. D. Bu, Y. Zhao, L. Cai, H. Xue, X. Zhu, H. Lu, J. Zhang, S. Sun, L. Ling, N. Zhang, G. Li, and R. Chen, Topological structure analysis of the protein-protein interaction network in budding yeast, Nucl. Acids Res. 31, 2443 (2003). 1362-4962 10.1093/nar/gkg340
33. M. Ripeanu, A. Iamnitchi, and I. Foster, Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design, IEEE Internet Comput. 6, 50 (2002). 10.1109/4236.978369
34. E. Cho, S. A. Myers, and J. Leskovec, Friendship and mobility: User movement in localation-based social networks, in ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA, 2011 (ACM, New York, NY, 2011), pp. 1082-1090.
35. M. E. J. Newman, Random Graphs with Clustering, Phys. Rev. Lett. 103, 058701 (2009). PRLTAO 0031-9007 10.1103/PhysRevLett.103.058701
36. D. Krioukov, F. Papadopoulos, M. Kitsak, A. Vahdat, and M. Boguná, Hyperbolic geometry of complex networks, Phys. Rev. E 82, 036106 (2010). PLEEE8 1539-3755 10.1103/PhysRevE.82.036106
37. F. Krzakala, C. Moore, E. Mossel, J. Neeman, A. Sly, L. Zedborová, and P. Zhang, Spectral redemption in clustering sparse networks, Proc. Natl. Acad. Sci. USA 110, 20935 (2013). PNASA6 0027-8424 10.1073/pnas.1312486110
38. K. Hashimoto, Zeta functions of finite graphs and representations of (Equation presented)-adic groups, Adv. Stud. Pure Math. 15, 211 (1989). 10.1016/B978-0-12-330580-0.50015-X
39. A. Braunstein, L. Dall'Asta, G. Semerjian, and L. Zdeborová, Network dismantling, arXiv:1603.08883.
40. P. Clusella, P. Grassberger, F. J. Pérez-Reche, and A. Politi, Immunization and targeted destruction of networks using explosive percolation, arXiv:1604.00073.
41. F. Morone, B. Min, L. Bo, R. Mari, and H. A. Makse, Collective Influence algorithm to find influencers via optimal percolation in massively large social media, arXiv:1603.08273v1.