Analyzing Vulnerabilities of the German High- Speed Train Network Using Quantitative Graph Theory

Analyzing Vulnerabilities of the German High- Speed Train Network Using Quantitative Graph Theory

Zhonglin Wang Martin Zsifkovits Stefan W. Pickl

Institute for Theoretical Computer Science, Mathematics and Operations Research,Universität der Bundeswehr München, Germany

| |
| | Citation



The German high-speed train system (ICE) as one of the critical infrastructures is mapped into a distance-weighted undirected network. The aim of the analysis is to make full use of quantitative graph theory in order to analyze the vulnerabilities of the network and to detect the centers and hubs of the system. When conducting network analysis of railways, there is a tradition of such an analysis that the betweenness centrality measure and the efficiency measure would be applied; however, based on these two measures, we offer a new promising one that we call betweenness-efficiency vulnerability measure, which can be used to detect the most vulnerable nodes on an aggregated level. By analyzing and comparing the results of these three measures, highly vulnerable stations are identified, which therefore have more potential to harm the overall system in case of disruption. This can help decision-makers to understand the structure, behavior and vulnerabilities of the network more directly from the point of view of quantitative graph theory. Finally, the problem of adapting a new vulnerability measure to this kind of system is discussed.


betweenness centrality, efficiency, quantitative graph theory, vulnerability analysis

1. Introduction
2. Graph Model and Quantitative Graph
3. Results
4. Conclusions and Discussions

[1] Rinaldi, S.M., Modeling and simulating critical infrastructures and their interdependencies. In: Proceedings of the 37th annual Hawaii international conference on System sciences, pp. 1–8, 2004.

[2] ICE-Netz. Deutsche Bahn, 2016, available at (accessed 07 March, 2017).

[3] Dehmer, M. & Emmert-Streib, F., Quantitative Graph Theory: Mathematical Foundations and Applications. CRC Press, 2014.

[4] Dehmer, M., Emmert-Streib, F. & Pickl, S., Computational Network Theory: Theoretical foundations and applications. Wiley-VCH Verlang GmbH & Co. KGaA, Weinheim, 2015.

[5] Freeman, L.C., Centrality in social networks conceptual clarification. Social Networks, 1, pp. 215–239, 1978.

[6] Latora, V. & Marchiori, M., Economic small-world behavior in weighted networks. The European Physical Journal B-Condensed Matter and Complex Systems, 32(2), pp. 249–263, 2003.

[7] Nistor, M.S., Pickl, S., Raap, M. & Zsifkovits, M., Network efficiency and vulnerability analysis using the flow-weighted efficiency measure. International Transactions in Operational Research, 2017.

[8] Dangalchev, C., Residual closeness in networks. Physica A: Statistical Mechanics and its Applications, 365, pp. 556–564, 2006.

[9] Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H.E. & Havlin, S., Catastrophic cascade of failures in interdependent networks. Nature, 464, pp. 1025–1028, 2010.

[10] Gao, J., Buldyrev, S.V., Havlin, S. & Stanley, H.E., Robustness of a network of networks. Physical Review Letters, 107(19), 2011.