Detecting Critical Links in Complex Network to Maintain Information Flow/Reachability

We address the problem of efficiently detecting critical links in a large network. Critical links are such links that their deletion exerts substantial effects on the network performance. Here in this paper, we define the performance as being the average node reachability. This problem is computationally very expensive because the number of links is an order of magnitude larger even for a sparse network. We tackle this problem by using bottom-k sketch algorithm and further by employing two new acceleration techniques: marginal-link updating (MLU) and redundant-link skipping (RLS). We tested the effectiveness of the proposed method using two real-world large networks and two synthetic large networks and showed that the new method can compute the performance degradation by link removal about an order of magnitude faster than the baseline method in which bottom-k sketch algorithm is applied directly. Further, we confirmed that the measures easily composed by well known existing centralities, e.g. in/out-degree, betweenness, PageRank, authority/hub, are not able to detect critical links. Those links detected by these measures do not reduce the average reachability at all, i.e. not critical at all.

[1]  Christos Faloutsos,et al.  Patterns of Cascading Behavior in Large Blog Graphs , 2007, SDM.

[2]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[3]  Sebastiano Vigna,et al.  In-Core Computation of Geometric Centralities with HyperBall: A Hundred Billion Nodes and Beyond , 2013, 2013 IEEE 13th International Conference on Data Mining Workshops.

[4]  Masahiro Kimura,et al.  Super mediator - A new centrality measure of node importance for information diffusion over social network , 2016, Inf. Sci..

[5]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

[6]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[7]  Li Guo,et al.  On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization , 2015, IEEE Transactions on Knowledge and Data Engineering.

[8]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Masahiro Kimura,et al.  Speeding-up node influence computation for huge social networks , 2015, International Journal of Data Science and Analytics.

[10]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[11]  Masahiro Kimura,et al.  Efficient analysis of node influence based on SIR model over huge complex networks , 2014, 2014 International Conference on Data Science and Advanced Analytics (DSAA).

[12]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[13]  Jon M. Kleinberg,et al.  Mining the Web's Link Structure , 1999, Computer.

[14]  Edith Cohen,et al.  Sketch-based Influence Maximization and Computation: Scaling up with Guarantees , 2014, CIKM.

[15]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[16]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[17]  Yu Wang,et al.  Influence Maximization on Large-Scale Mobile Social Network: A Divide-and-Conquer Method , 2015, IEEE Transactions on Parallel and Distributed Systems.

[18]  Masahiro Kimura,et al.  Blocking links to minimize contamination spread in a social network , 2009, TKDD.

[19]  Masahiro Kimura,et al.  Resampling-Based Framework for Estimating Node Centrality of Large Social Network , 2014, Discovery Science.

[20]  Christian Borgs,et al.  Maximizing Social Influence in Nearly Optimal Time , 2012, SODA.

[21]  Masahiro Kimura,et al.  Extracting Influential Nodes for Information Diffusion on a Social Network , 2007, AAAI.

[22]  Edith Cohen,et al.  All-Distances Sketches, Revisited: HIP Estimators for Massive Graphs Analysis , 2013, IEEE Transactions on Knowledge and Data Engineering.

[23]  Laks V. S. Lakshmanan,et al.  A Data-Based Approach to Social Influence Maximization , 2011, Proc. VLDB Endow..

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

[25]  Silvio Lattanzi,et al.  Efficient Algorithms for Public-Private Social Networks , 2015, KDD.

[26]  Masahiro Kimura,et al.  Learning Information Diffusion Model for Extracting Influential Nodes in a Social Network , 2010 .

[27]  Stephanie Forrest,et al.  Email networks and the spread of computer viruses. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  Masahiro Kimura,et al.  Efficient Estimation of Influence Functions for SIS Model on Social Networks , 2009, IJCAI.

[29]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[30]  Edith Cohen,et al.  Size-Estimation Framework with Applications to Transitive Closure and Reachability , 1997, J. Comput. Syst. Sci..

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