Network Centrality of Metro Systems
Author(s)
Derrible, Sybil
DownloadDerrible-2012-Network centrality o.pdf (496.4Kb)
PUBLISHER_CC
Publisher with Creative Commons License
Creative Commons Attribution
Terms of use
Metadata
Show full item recordAbstract
Whilst being hailed as the remedy to the world’s ills, cities will need to adapt in the 21st century. In particular, the role of public transport is likely to increase significantly, and new methods and technics to better plan transit systems are in dire need. This paper examines one fundamental aspect of transit: network centrality. By applying the notion of betweenness centrality to 28 worldwide metro systems, the main goal of this paper is to study the emergence of global trends in the evolution of centrality with network size and examine several individual systems in more detail. Betweenness was notably found to consistently become more evenly distributed with size (i.e. no “winner takes all”) unlike other complex network properties. Two distinct regimes were also observed that are representative of their structure. Moreover, the share of betweenness was found to decrease in a power law with size (with exponent 1 for the average node), but the share of most central nodes decreases much slower than least central nodes (0.87 vs. 2.48). Finally the betweenness of individual stations in several systems were examined, which can be useful to locate stations where passengers can be redistributed to relieve pressure from overcrowded stations. Overall, this study offers significant insights that can help planners in their task to design the systems of tomorrow, and similar undertakings can easily be imagined to other urban infrastructure systems (e.g., electricity grid, water/wastewater system, etc.) to develop more sustainable cities.
Date issued
2012-07Department
Singapore-MIT Alliance in Research and Technology (SMART)Journal
PLoS ONE
Publisher
Public Library of Science
Citation
Derrible, Sybil. “Network Centrality of Metro Systems.” Ed. Petter Holme. PLoS ONE 7.7 (2012): e40575.
Version: Final published version
ISSN
1932-6203