Advertisement

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

  • G. P. ClementeEmail author
  • A. Cornaro
Focus
  • 15 Downloads

Abstract

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.

Keywords

Robustness Kirchhoff index Complex networks Air transportation networks Spatial economics 

Notes

Acknowledgements

We would like to thank the editor, the guest editor of the Special Issue “Dynamics of socio-economic systems” and the anonymous referees for their careful reviews on a previous version of this paper. We also thank the attendants to DySES (Dynamics of Socio Economic Systems) 2018 and Workshop on the Economic Science with Heterogeneous Interacting Agents 2019 for their very constructive comments.

Compliance with ethical standards

Conflict of interest

Both authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

References

  1. Abbas W, Egerstedt M (2012) Robust graph topologies for networked systems. In: 3rd IFAC workshop on distributed estimation and control in networked systems, pp 85–90CrossRefGoogle Scholar
  2. Albert R, Barabási AL (2002) Statistical mechanics of complex networks. Rev Mod Phys 74:47MathSciNetzbMATHCrossRefGoogle Scholar
  3. Albert R, Jeong H, Barabási AL (2000) Error and attack tolerance of complex networks. Nature 406:378–382CrossRefGoogle Scholar
  4. Alderighi M, Cento A, Nijkamp P, Rietveld P (2007) Assessment of new hub-and-spoke and point-to-point airline network configurations. Transp Rev 27(5):529–549CrossRefGoogle Scholar
  5. Bania N, Bauer PW, Zlatoper TJ (1998) U.S. air passenger service: a taxonomy of route networks, hub locations, and competition. Transp Res E 34(1):53–74CrossRefGoogle Scholar
  6. Barabási AL (2014) Network science. Cambridge University Press, CambridgezbMATHGoogle Scholar
  7. Barrat A, Barthélemy M, Pastor-Satorras R, Vespignani A (2004) The architecture of complex weighted networks. Proc Natl Acad Sci 101(11):3747–3752CrossRefGoogle Scholar
  8. Barrett SD (2004) How do the demands for airport services differ between full-service carriers and low-cost carriers? J Air Transp Manag 10(1):33–39CrossRefGoogle Scholar
  9. Battistion S, Puliga M, Kaushik R, Tasca P, Caldarelli G (2012) DebtRank: too central to fail? financial networks, the FED and systemic risk. Sci Rep 2:541CrossRefGoogle Scholar
  10. Bavelas A (1950) Communication patterns in task-oriented groups. J Acoust Soc Am 22(6):725–730CrossRefGoogle Scholar
  11. Bendito E, Carmona A, Encinas AM, Gesto JM, Mitjana M (2010) Kirchhoff indexes of a network. Linear Algebra Appl 1432:2278–2292zbMATHCrossRefGoogle Scholar
  12. Bianchi M, Cornaro A, Palacios JL, Torriero A (2013) Bounds for the Kirchhoff index via majorization techniques. J Math Chem 51(2):569–587MathSciNetzbMATHCrossRefGoogle Scholar
  13. Boccaletti S, Latora V, Moreno Y, Chavez M, Hwanga DU (2006) Complex networks: structure and dynamics. Phys Rep 424:175–308MathSciNetzbMATHCrossRefGoogle Scholar
  14. Bollobás B (1998) Modern graph theory, 1st edn. Graduate Texts in Mathematics 184. Springer, New YorkzbMATHCrossRefGoogle Scholar
  15. Bonacich P (1972) Factoring and weighting approaches to status scores and clique identification. J Math Sociol 2(1):113–120CrossRefGoogle Scholar
  16. Chen H, Zhang F (2007) Resistance distance and the normalized Laplacian spectrum. Discret Appl Math 155:654–661MathSciNetzbMATHCrossRefGoogle Scholar
  17. Chi LP, Cai X (2004) Structural changes caused by error and attack tolerance in US airport network. Int J Mod Phys B 18:2394–2400CrossRefGoogle Scholar
  18. Clemente GP, Cornaro A (2015) Computing lower bounds for the Kirchhoff index via majorization techniques. MATCH Commun Math Comput Chem 73:175–193MathSciNetzbMATHGoogle Scholar
  19. Clemente GP, Cornaro A (2019) Bounding robustness in complex networks under topological changes through majorization techniques. arXiv:1906.09056
  20. Clemente GP, Grassi R (2018) Directed clustering in weighted networks: a new perspective. Chaos Solitons Fract 107:26–38MathSciNetCrossRefGoogle Scholar
  21. Cohen R, Ben-Avraham D, Havlin S (2002) Percolation critical exponents in scale-free networks. Phys Rev E 66:036113CrossRefGoogle Scholar
  22. Cohen R, Havlin S, Ben-Avraham D (2003) Efficient immunization strategies for computer networks and populations. Phys Rev Lett 91:247901CrossRefGoogle Scholar
  23. Cornaro A, Clemente GP (2013) A New Lower Bound for the Kirchhoff Index using a numerical procedure based on Majorization Techniques. Electron Notes Discret Math 41:383–390CrossRefGoogle Scholar
  24. Costa F, Rodrigues FA, Travieso G, Villas Boas PR (2007) Characterization of complex networks: a survey of measurements. Adv Phys 56(1):167–242CrossRefGoogle Scholar
  25. Croci E, Grassi R (2014) The economic effect of interlocking directorates in Italy: new evidence using centrality measures. Comput Math Organ Theory 20(1):89–112CrossRefGoogle Scholar
  26. Dorogovtsev SN, Mendes JFF (2002) Evolution of networks. Adv Phys 51:1079–1187CrossRefGoogle Scholar
  27. Ellens W (2011) Effective resistance and other graph measures for network robustness. Master’s thesis, Mathematical Institute, University of LeidenGoogle Scholar
  28. Ellens W, Spieksma FM, Van Mieghem P, Jamakovic A, Kooij RE (2011) Effective graph resistance. Linear algebra and its applications, pp 2491–2506Google Scholar
  29. Erdős P, Rényi A (1959) On Random Graphs I. Publ Math 6:290–297MathSciNetzbMATHGoogle Scholar
  30. Erdős P, Rényi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci 5:17–61MathSciNetzbMATHGoogle Scholar
  31. Estrada E, Hatano N (2010) Resistance distance, information centrality, node vulnerability and vibrations in complex networks. In: Network scienceGoogle Scholar
  32. Feng L, Gutman I, Yu L (2010) Degree resistance distance of unicyclic graphs. Trans Comb 1:27–40MathSciNetzbMATHGoogle Scholar
  33. Fiedler M (1973) Algebraic connectivity of graphs. Czechoslov Math J 23:298–305MathSciNetzbMATHGoogle Scholar
  34. Forsyth P (2010) Competition between major and secondary airports: implication for pricing, regulation and welfare. In: Forsyth P, Gillen D, Müller J, Niemener HM (eds) Airport competition: the European experience. Ashgate, FarnhamGoogle Scholar
  35. Freeman LC (1977) A set of measures of centrality based on betweenness. Sociometry 40:35–41CrossRefGoogle Scholar
  36. Fröhlich K, Niemeier H-M (2011) The importance of spatial economics for assessing airport competition. J Air Transp Manag 17(1):44–48CrossRefGoogle Scholar
  37. Ghosh A, Boyd S, Saberi A (2008) Minimizing effective graph resistance of a graph. SIAM Rev 50:37–66MathSciNetzbMATHCrossRefGoogle Scholar
  38. Goetz AR, Christopher JS (1997) The geography of deregulation in the U.S. airline industry. Ann Assoc Am Geogr 87(2):238–263CrossRefGoogle Scholar
  39. Grassi R (2010) Vertex centrality as a measure of information flow in italian corporate board networks. Phys A: Stat Mech Appl 389(12):2455–2464CrossRefGoogle Scholar
  40. Grone R, Merris R (1994) The Laplacian spectrum of a graph II. SIAM J Discret Math 7(2):221–229MathSciNetzbMATHCrossRefGoogle Scholar
  41. Harary F (1969) Graph Theory. Addison-Wesley Publishing Company, BostonzbMATHCrossRefGoogle Scholar
  42. Iyer S, Killingback T, Sundaram B, Wang Z (2013) Attack robustness and centrality of complex networks. PloS One 8(4):e59613CrossRefGoogle Scholar
  43. Klein DJ (2002) Resistance-distance sum rules. Croat Chem Acta 75(2):633–649Google Scholar
  44. Klein DJ, Lukovits I, Gutman I (1995) On the definition of the hyper-wiener index for cycle-containing structures. J Chem Inf Comput Sci 35(1):50–52CrossRefGoogle Scholar
  45. Klein DJ, Randić M (1993) Resistance Distance. J Math Chem 12:81–95MathSciNetCrossRefGoogle Scholar
  46. Lee DM (2006) Advances in airline economics: competition policy and antitrust. Elsevier, AmsterdamGoogle Scholar
  47. Lillo F, Micciché F, Mantegna RN, Beato V, Pozzi S (2011) ELSA project: toward a complex network approach to ATM delays analysis. In: Proceedings on the INO 2011 conferenceGoogle Scholar
  48. Lukovits I, Nikolić S, Trinastić N (1999) Resistance-distance in regular graphs. Int J Quantum Chem 71(3):217–225CrossRefGoogle Scholar
  49. Markose S, Giansante S, Shaghaghi AR (2012) Too interconnected to fail financial network of US CDS market: topological fragility and systemic risk. J Econ Behav Organ 83(3):627–646CrossRefGoogle Scholar
  50. Martin C, Niemeyer P (2015) Comparing the sensitivity of social networks, web graphs, and random graphs with respect to vertex removal. In: 11th International conference on signal-image technology and internet-based systems (SITIS). IEEE, pp 460–467Google Scholar
  51. Molloy M, Reed B (1995) A critical point for random graphs with a given degree sequence. Random Struct Algorithms 6:161–180MathSciNetzbMATHCrossRefGoogle Scholar
  52. Newman MEJ (2002) The structure and function of complex networks. SIAM Rev 45:167–256MathSciNetzbMATHCrossRefGoogle Scholar
  53. Palacios JL (2001) Closed form formulas for Kirchhoff index. Int J Quantum Chem 81:135–140CrossRefGoogle Scholar
  54. Palacios JL (2015) On the Kirchhoff index of graphs with diameter 2. Discret Appl Math 184(31):196–201MathSciNetzbMATHCrossRefGoogle Scholar
  55. Palacios JL (2016) Some Additional Bounds for the Kirchhoff Index. MATCH-Commun Math Comput Chem 75:365–372MathSciNetzbMATHGoogle Scholar
  56. Palacios JL, Renom JM (2010) Bounds for the Kirchhoff index of regular graphs via the spectra of their random walks. Int J Quantum Chem 110:1637–1641Google Scholar
  57. Starkie D (2008) The airport industry in a competitive environment: a United Kingdom perspective. In: International Transport Forum. OECDGoogle Scholar
  58. Van Mieghem P (2011) Graph spectra for complex networks. Cambridge University Press, CambridgezbMATHGoogle Scholar
  59. Van Mieghem P, Ge X, Schumm P, Trajanovski S, Wang H (2010) Spectral graph analysis of modularity and assortativity. Phys Rev E 82:56–113Google Scholar
  60. Varela LM, Rotundo G (2016) Complex network analysis and nonlinear dynamics. In: Complex Networks and Dynamics. Springer, pp 3–25Google Scholar
  61. Wang H, Hua H, Wang D (2010) Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices. Math Commun 15:347–358MathSciNetzbMATHGoogle Scholar
  62. Wang X, Pournaras E, Kooij RE, Van Mieghem P (2014) Improving robustness of complex networks via the effective graph resistance. Eur Phys J B 87(9):221CrossRefGoogle Scholar
  63. Watts DJ, Strogatz SH (1998) Dynamics of ‘Small World’ networks. Nature 393:440–444zbMATHCrossRefGoogle Scholar
  64. Zanin M, Lillo F (2013) Modelling the air transport with complex networks: a short review. Eur Phys J Spec Top 215:5–21CrossRefGoogle Scholar
  65. Zhang H, Yang Y, Li C (2009) Kirchhoff index of composite graphs. Discret Appl Math 157:2918–2927MathSciNetzbMATHCrossRefGoogle Scholar
  66. Zhu HY, Klein DJ, Lukovits I (1996) Extensions of the Wiener number. J Chem Inf Comput Sci 36:420–428CrossRefGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Departimento di Matematica per le Scienze Economiche, Finanziarie e AttuarialiUniversità Cattolica del Sacro CuoreMilanItaly

Personalised recommendations