The (betweenness) centrality of critical nodes and network cores

The betweenness centrality of a node is a measure related to the number of shortest path the node is involved with. It is, indeed, a measure of the importance of the node in the network, and in the recent years has been used intensively for network analysis. The major drawback of this measure is its high computational cost, and thus in the literature several works appeared providing ways of approximating it, thus presenting a trade off between accuracy and speed. The articulation points of a connected network are the nodes whose removal disconnects the network, and the critical nodes are the articulation points of the network core, i.e. the subset of the network obtained by repeatedly pruning the nodes of low (fixed) degree. In [1] Ausiello et al. showed that, in ten years of samples of the Autonomous System (AS) Network, the removal of a single critical node from the network was able to affect hundreds of nodes, that were no longer connected to the main part of the AS Network.

[1]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Ziv Bar-Yossef,et al.  Reductions in streaming algorithms, with an application to counting triangles in graphs , 2002, SODA '02.

[3]  Thomas Erlebach,et al.  Computing the types of the relationships between autonomous systems , 2007, IEEE/ACM Trans. Netw..

[4]  Giorgio Ausiello,et al.  Real-time analysis of critical nodes in network cores , 2012, 2012 8th International Wireless Communications and Mobile Computing Conference (IWCMC).

[5]  Luigi Laura,et al.  Computing Strongly Connected Components in the Streaming Model , 2011, TAPAS.

[6]  Thomas Erlebach,et al.  Assigning AS relationships to satisfy the Gao-Rexford conditions , 2010, The 18th IEEE International Conference on Network Protocols.

[7]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[8]  Giuseppe F. Italiano,et al.  An Experimental Study of Dynamic Dominators , 2012, ESA.

[9]  Giorgio Ausiello,et al.  Real‐time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components , 2012, Networks.

[10]  Jeffery R. Westbrook,et al.  A Functional Approach to External Graph Algorithms , 1998, Algorithmica.

[11]  Giuseppe Di Battista,et al.  Algorithms for the Inference of the Commercial Relationships between Autonomous Systems: Results Analysis and Model Validation , 2004 .

[12]  Giuseppe F. Italiano,et al.  Graph Spanners in the Streaming Model: An Experimental Study , 2009, Algorithmica.

[13]  Ulrik Brandes,et al.  Centrality Estimation in Large Networks , 2007, Int. J. Bifurc. Chaos.

[14]  A. Kemper,et al.  On Graph Problems in a Semi-streaming Model , 2015 .

[15]  David A. Bader,et al.  A Fast Algorithm for Streaming Betweenness Centrality , 2012, 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing.

[16]  Maurizio Patrignani,et al.  Dynamic Analysis of the Autonomous System Graph , 2004 .

[17]  David A. Bader,et al.  Approximating Betweenness Centrality , 2007, WAW.

[18]  Joan Feigenbaum,et al.  Graph distances in the streaming model: the value of space , 2005, SODA '05.

[19]  Giuseppe F. Italiano,et al.  Finding strong bridges and strong articulation points in linear time , 2010, Theor. Comput. Sci..

[20]  Robert E. Tarjan,et al.  Finding Dominators in Practice , 2004, ESA.

[21]  Giuseppe F. Italiano,et al.  Strong Articulation Points and Strong Bridges in Large Scale Graphs , 2012, Algorithmica.

[22]  Prabhakar Raghavan,et al.  Computing on data streams , 1999, External Memory Algorithms.

[23]  U. Brandes.  A faster algorithm for betweenness centrality , 2001 .

[24]  Vladimir Batagelj,et al.  Generalized Cores , 2002, ArXiv.

[25]  Giorgio Ausiello,et al.  Real-time anomalies detection and analysis of network structure, with application to the Autonomous System network , 2011, 2011 7th International Wireless Communications and Mobile Computing Conference.

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

[27]  Michael Elkin,et al.  Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners , 2007, TALG.

[28]  Jeffrey Scott Vitter,et al.  External memory algorithms and data structures: dealing with massive data , 2001, CSUR.

[29]  Randy H. Katz,et al.  Characterizing the Internet hierarchy from multiple vantage points , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[30]  Andrew McGregor.  Finding Matchings in the Streaming Model , 2004 .

[31]  Tony Bates,et al.  Guidelines for creation, selection, and registration of an Autonomous System (AS) , 1996, RFC.

[32]  Massimo Riccaboni,et al.  Betweenness centrality of fractal and nonfractal scale-free model networks and tests on real networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  S. Muthukrishnan,et al.  Data streams: algorithms and applications , 2005, SODA '03.

[34]  Michalis Faloutsos,et al.  On power-law relationships of the Internet topology , 1999, SIGCOMM '99.