Fast and simple decycling and dismantling of networks

Scientific Reports

Volumn 6, Issue , 2016, Pages

  Zdeborová, Lenka ^a   Zhang, Pan ^b   Zhou, Hai Jun ^b  

^a UNIVERSITÉ PARIS SACLAY   (France)

^b INSTITUTE OF THEORETICAL PHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84999863135     PISSN: None     EISSN: 20452322     Source Type: Journal    
DOI: 10.1038/srep37954     Document Type: Article

References (28)

1. Zhou, H.-J. Spin glass approach to the feedback vertex set problem. Eur. Phys. J. B 86, 455 (2013).
2. Altarelli, F., Braunstein, A., Dall'Asta, L. & Zecchina, R. Optimizing spread dynamics on graphs by message passing. Journal of Statistical Mechanics: Theory and Experiment 2013, P09011 (2013).
3. Guggiola, A. & Semerjian, G. Minimal contagious sets in random regular graphs. Journal of Statistical Physics 158, 300-358 (2015).
4. Morone, F. & Makse, H. A. Influence maximization in complex networks through optimal percolation. Nature 524, 65-68 (2015).
5. Mugisha, S. & Zhou, H.-J. Identifying optimal targets of network attack by belief propagation. Phys. Rev. E 94, 012305 (2016).
6. Braunstein, A., Dall'Asta, L., Semerjian, G. & Zdeborová, L. Network dismantling. Proceedings of the National Academy of Sciences 113, 12368-12373 (2016).
7. Qin, S.-M., Zeng, Y. & Zhou, H.-J. Spin glass phase transitions in the random feedback vertex set problem. arXiv preprint arXiv:1603.09032 (2016).
8. Clusella, P., Grassberger, P., Pérez-Reche, F. J. & Politi, A. Immunization and targeted destruction of networks using explosive percolation. arXiv:1604.00073 (2016).
9. Karp, R. M. Reducibility among combinatorial problems. In Complexity of computer computations, 85-103 (Springer, 1972).
10. Janson, S. & Thomason, A. Dismantling sparse random graphs. Combinatorics, Probability and Computing 17, 259-264 (2008).
11. Richardson, M. & Domingos, P. Mining knowledge-sharing sites for viral marketing. In Proceedings of 8th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 61-70 (ACM, New York, NY, 2002).
12. Kempe, D., Kleinberg, J. & Tardos, E. Maximizing the spread of influence through a social network. Theory of Computing 11, 105-147 (2015).
13. Jung, K., Heo, W. & Chen, W. Irie: Scalable and robust influence maximization in social networks. In 2012 IEEE 12th International Conference on Data Mining, 918-923 (IEEE, 2012).
14. Borgs, C., Brautbar, M., Chayes, J. & Lucier, B. Maximizing social influence in nearly optimal time. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 946-957 (Society for Industrial and Applied Mathematics, 2014).
15. Albert, R., Jeong, H. & Barabási, A.-L. Error and attack tolerance of complex networks. Nature 406, 378-382 (2000).
16. Cohen, R., Erez, K., ben-Avraham, D. & Havlin, S. Breakdown of the internet under intentional attack. Physical review letters 86, 3682 (2001).
17. Bau, S., Wormald, N. C. & Zhou, S. Decycling numbers of random regular graphs. Random Structures & Algorithms 21, 397-413 (2002).
18. Zhang, P. Nonbacktracking operator for the ising model and its applications in systems with multiple states. Phys. Rev. E 91, 042120 (2015).
19. Pei, S., Teng, X., Shaman, J., Morone, F. & Makse, H. A. Collective influence maximization in threshold models of information cascading with first-order transitions. arXiv preprint arXiv:1606.02739 (2016).
20. Goh, K.-I., Kahng, B. & Kim, D. Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87, 278701 (2001).
21. Šubelj, L. & Bajec, M. Robust network community detection using balanced propagation. Eur. Phys. J. B 81, 353-362 (2011).
22. Bu, D. et al. Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Res. 31, 2443-2450 (2003).
23. Watts, D. J. & Strogatz, S. H. Collective dynamics of 'small-world' netowrks. Nature 393, 440-442 (1998).
24. Leskovec, J., Kleinberg, J. & Faloutsos, C. 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, 177-187 (ACM, New York, 2005).
25. Leskovec, J., Kleinberg, J. & Faloutsos, C. Graph evolution: Densification and shrinking diameters. ACM Transactions on Knowledge Discovery from Data 1, 2 (2007).
26. Ripeanu, M., Foster, I. & Iamnitchi, A. Mapping the gnutella network: Properties of large-scale peer-to-peer systems and implications for system design. IEEE Internet Comput. 6, 50-57 (2002).
27. Cho, E., Myers, S. A. & Leskovec, J. Friendship and mobility: User movement in localation-based social networks. In ACM SIGKDD International Conference o Knowledge Discovery and Data Mining, 1082-1090 (San Diego, CA, USA, 2011).
28. Leskovec, J., Lang, K. J., Dasgupta, A. & Mahoney, M. W. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. Internet Math. 6, 29-123 (2009).