Identifying vital nodes based on reverse greedy method

The identification of vital nodes that maintain the network connectivity is a long-standing challenge in network science. In this paper, we propose a so-called reverse greedy method where the least important nodes are preferentially chosen to make the size of the largest component in the corresponding induced subgraph as small as possible. Accordingly, the nodes being chosen later are more important in maintaining the connectivity. Empirical analyses on eighteen real networks show that the reverse greedy method performs remarkably better than well-known state-of-the-art methods.

[1]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[2]  Mônica G. Campiteli,et al.  An index to quantify an individual's scientific research valid across disciplines , 2005 .

[3]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Hernán A. Makse,et al.  Collective Influence Algorithm to find influencers via optimal percolation in massively large social media , 2016, Scientific Reports.

[5]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[6]  Christos Faloutsos,et al.  Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.

[7]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[8]  R. May,et al.  Systemic risk in banking ecosystems , 2011, Nature.

[9]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[10]  Tao Zhou,et al.  The H-index of a network node and its relation to degree and coreness , 2016, Nature Communications.

[11]  Petter Holme,et al.  Simulated Epidemics in an Empirical Spatiotemporal Network of 50,185 Sexual Contacts , 2010, PLoS Comput. Biol..

[12]  Jon M. Kleinberg,et al.  Overview of the 2003 KDD Cup , 2003, SKDD.

[13]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[14]  Yunpeng Wang,et al.  Percolation transition in dynamical traffic network with evolving critical bottlenecks , 2014, Proceedings of the National Academy of Sciences.

[15]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[16]  Yi-Cheng Zhang,et al.  Leaders in Social Networks, the Delicious Case , 2011, PloS one.

[17]  B. Bollobás.  The evolution of random graphs , 1984 .

[18]  Lenka Zdeborová,et al.  Fast and simple decycling and dismantling of networks , 2016, Scientific Reports.

[19]  Eric A. Hansen,et al.  Beam-Stack Search: Integrating Backtracking with Beam Search , 2005, ICAPS.

[20]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[21]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[22]  Krishna P. Gummadi,et al.  On the evolution of user interaction in Facebook , 2009, WOSN '09.

[23]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[24]  P. Bonacich.  Factoring and weighting approaches to status scores and clique identification , 1972 .

[25]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[26]  Réka Albert,et al.  Structural vulnerability of the North American power grid. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Adilson E Motter,et al.  Cascade-based attacks on complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Jure Leskovec,et al.  Friendship and mobility: user movement in location-based social networks , 2011, KDD.

[29]  Christos Faloutsos,et al.  Graph evolution: Densification and shrinking diameters , 2006, TKDD.

[30]  Guido Caldarelli,et al.  Scale-Free Networks , 2007 .

[31]  Hai-Jun Zhou,et al.  Spin glass approach to the feedback vertex set problem , 2013, 1307.6948.

[32]  M E J Newman.  Assortative mixing in networks. , 2002, Physical review letters.

[33]  Pablo M. Gleiser,et al.  Community Structure in Jazz , 2003, Adv. Complex Syst..

[34]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[35]  Hai-Jun Zhou,et al.  Identifying optimal targets of network attack by belief propagation , 2016, Physical review. E.

[36]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[37]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[38]  Xiaofan Wang,et al.  Unified index to quantifying heterogeneity of complex networks , 2008 .

[39]  Adilson E Motter.  Cascade control and defense in complex networks. , 2004, Physical review letters.

[40]  Duanbing Chen,et al.  Vital nodes identification in complex networks , 2016, ArXiv.

[41]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[42]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[43]  Antonio Politi,et al.  Immunization and targeted destruction of networks using explosive percolation , 2016, Physical review letters.