A topological analysis of underground network performance under disruptive events

Every disruptive event in a transportation network has costly consequences both for users and for managing companies. To prevent large declines in the desired level of mobility, it is important to locate the most important nodes of the network, and to strengthen them. In this paper, we focus on underground networks. We introduce a methodology based on graph theory to locate the most important nodes, and we apply it to Washington D.C. network as a case study, and to the underground networks of 34 cities all over the world.