A novel measure of edge and vertex centrality for assessing robustness in complex networks

In this work, we propose a novel robustness measure for networks, which we refer to as Effective Resistance Centrality of a vertex (or an edge), defined as the relative drop of the Kirchhoff index due to deletion of this vertex (edge) from the network. Indeed, we provide a local robustness measure, able to catch which is the effect of either a specific vertex or a specific edge on the network robustness. The validness of this new measure is illustrated on some typical graphs and on a wide variety of well-known model networks. Furthermore, we analyse the topology of the US domestic flight connections. In particular, we investigate the role that airports play in maintaining the structure of the entire network.

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

[2]  Margarida Mitjana,et al.  Kirchhoff Indexes of a network , 2010 .

[3]  Anna Torriero,et al.  Bounds for the Kirchhoff index via majorization techniques , 2013, Journal of Mathematical Chemistry.

[4]  M. Fiedler Algebraic connectivity of graphs , 1973 .

[5]  Giulia Rotundo,et al.  Complex Network Analysis and Nonlinear Dynamics , 2016 .

[6]  Christoph Martin,et al.  Comparing the Sensitivity of Social Networks, Web Graphs, and Random Graphs with Respect to Vertex Removal , 2014, 2015 11th International Conference on Signal-Image Technology & Internet-Based Systems (SITIS).

[7]  Béla Bollobás,et al.  Modern Graph Theory , 2002, Graduate Texts in Mathematics.

[8]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[9]  Hans-Martin Niemeier,et al.  The importance of spatial economics for assessing airport competition , 2011 .

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

[11]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[12]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

[13]  István Lukovits,et al.  Extensions of the Wiener Number , 1996, J. Chem. Inf. Comput. Sci..

[14]  Stephen P. Boyd,et al.  Minimizing Effective Resistance of a Graph , 2008, SIAM Rev..

[15]  Simone Pozzi,et al.  ELSA Project: Toward a complex network approach to ATM delays analysis , 2011 .

[16]  Liping Chi,et al.  Structural Changes Caused by Error and Attack Tolerance in us Airport Network , 2004 .

[17]  José Luis Palacios On the Kirchhoff index of graphs with diameter 2 , 2015, Discret. Appl. Math..

[18]  David Starkie,et al.  The Airport Industry in a Competitive Environment: A United Kingdom Perspective , 2008 .

[19]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[20]  Andrew R. Goetz,et al.  The Geography of Deregulation in the U.S. Airline Industry , 1997 .

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

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

[23]  Frank Harary,et al.  Graph Theory , 2016 .

[24]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[25]  Heping Zhang,et al.  Kirchhoff index of composite graphs , 2009, Discret. Appl. Math..

[26]  Magnus Egerstedt,et al.  Robust Graph Topologies for Networked Systems , 2012 .

[27]  Fuji Zhang,et al.  Resistance distance and the normalized Laplacian spectrum , 2007, Discret. Appl. Math..

[28]  Rosanna Grassi,et al.  The economic effect of interlocking directorates in Italy: new evidence using centrality measures , 2014, Comput. Math. Organ. Theory.

[29]  Evangelos Pournaras,et al.  Improving robustness of complex networks via the effective graph resistance , 2014 .

[30]  István Lukovits,et al.  On the Definition of the Hyper-Wiener Index for Cycle-Containing Structures , 1995, J. Chem. Inf. Comput. Sci..

[31]  José Luis Palacios,et al.  Bounds for the Kirchhoff index of regular graphs via the spectra of their random walks , 2010 .

[32]  Sheri M Markose,et al.  ‘Too interconnected to fail’ financial network of US CDS market: Topological fragility and systemic risk , 2012 .

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

[34]  S. Barrett How do the demands for airport services differ between full-service carriers and low-cost carriers? , 2004 .

[35]  F. Spieksma,et al.  Effective graph resistance , 2011 .

[36]  José Luis Palacios Closed‐form formulas for Kirchhoff index , 2001 .

[37]  L. da F. Costa,et al.  Characterization of complex networks: A survey of measurements , 2005, cond-mat/0505185.

[38]  Piet Van Mieghem,et al.  Graph Spectra for Complex Networks , 2010 .

[39]  Fabrizio Lillo,et al.  Modelling the air transport with complex networks: A short review , 2013, The European Physical Journal Special Topics.

[40]  Thomas J. Zlatoper,et al.  U.S. Air Passenger Service: a Taxonomy of Route Networks, Hub Locations, and Competition , 1998 .

[41]  Ernesto Estrada,et al.  Resistance Distance, Information Centrality, Node Vulnerability and Vibrations in Complex Networks , 2010, Network Science.

[42]  Gian Paolo Clemente,et al.  A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques , 2013, Electron. Notes Discret. Math..

[43]  Rosanna Grassi,et al.  Vertex centrality as a measure of information flow in Italian Corporate Board Networks , 2010 .

[44]  Gian Paolo Clemente,et al.  Bounding robustness in complex networks under topological changes through majorization techniques , 2019, The European Physical Journal B.

[45]  A. Vespignani,et al.  The architecture of complex weighted networks. , 2003, Proceedings of the National Academy of Sciences of the United States of America.

[46]  P Van Mieghem,et al.  Spectral graph analysis of modularity and assortativity. , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[48]  G. Caldarelli,et al.  DebtRank: Too Central to Fail? Financial Networks, the FED and Systemic Risk , 2012, Scientific Reports.

[49]  István Lukovits,et al.  Resistance distance in regular graphs , 1999 .

[50]  Russell Merris,et al.  The Laplacian Spectrum of a Graph II , 1994, SIAM J. Discret. Math..

[51]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[52]  Douglas J. Klein,et al.  Resistance-Distance Sum Rules* , 2002 .

[53]  Rosanna Grassi,et al.  Directed clustering in weighted networks: a new perspective , 2017, ArXiv.

[54]  Guihai Yu,et al.  Degree resistance distance of unicyclic graphs , 2012 .

[55]  Albert-Lszl Barabsi,et al.  Network Science , 2016, Encyclopedia of Big Data.

[56]  T. Killingback,et al.  Attack Robustness and Centrality of Complex Networks , 2013, PloS one.

[57]  Peter Nijkamp,et al.  Assessment of New Hub‐and‐Spoke and Point‐to‐Point Airline Network Configurations , 2007 .

[58]  Reuven Cohen,et al.  Percolation critical exponents in scale-free networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.