A novel measure of edge and vertex centrality for assessing robustness in complex networks
- 15 Downloads
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.
KeywordsRobustness Kirchhoff index Complex networks Air transportation networks Spatial economics
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.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Clemente GP, Cornaro A (2019) Bounding robustness in complex networks under topological changes through majorization techniques. arXiv:1906.09056
- Ellens W (2011) Effective resistance and other graph measures for network robustness. Master’s thesis, Mathematical Institute, University of LeidenGoogle Scholar
- Ellens W, Spieksma FM, Van Mieghem P, Jamakovic A, Kooij RE (2011) Effective graph resistance. Linear algebra and its applications, pp 2491–2506Google Scholar
- Estrada E, Hatano N (2010) Resistance distance, information centrality, node vulnerability and vibrations in complex networks. In: Network scienceGoogle Scholar
- 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
- Klein DJ (2002) Resistance-distance sum rules. Croat Chem Acta 75(2):633–649Google Scholar
- Lee DM (2006) Advances in airline economics: competition policy and antitrust. Elsevier, AmsterdamGoogle Scholar
- 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
- 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
- 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
- Starkie D (2008) The airport industry in a competitive environment: a United Kingdom perspective. In: International Transport Forum. OECDGoogle Scholar
- 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
- Varela LM, Rotundo G (2016) Complex network analysis and nonlinear dynamics. In: Complex Networks and Dynamics. Springer, pp 3–25Google Scholar