A tale of two cities. Vulnerabilities of the London and Paris transit networks

This paper analyses the impact of random failure or attack on the public transit networks of London and Paris in a comparative study. In particular we analyze how the dysfunction or removal of sets of stations or links (rails, roads, etc.) affects the connectivity properties within these networks. We show how accumulating dysfunction leads to emergent phenomena that cause the transportation system to break down as a whole. Simulating different directed attack strategies, we find minimal strategies with high impact and identify a-priori criteria that correlate with the resilience of these networks. To demonstrate our approach, we choose the London and Paris public transit networks. Our quantitative analysis is performed in the frames of the complex network theory—a methodological tool that has emerged recently as an inter- disciplinary approach joining methods and concepts of the theory of random graphs, percolation, and statistical physics. Our finding is that in almost all respects Paris proves to be significantly more resilient than London due to higher organisation. In conclusion we demonstrate that taking into account cascading effects the network integrity is controlled for both networks by less than 0.5% of the stations i.e. 19 for Paris and 34 for London.

[1]  Béla Bollobás,et al.  Random Graphs , 1985 .

[2]  S. Bornholdt,et al.  Handbook of Graphs and Networks , 2012 .

[3]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[4]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[5]  Cohen,et al.  Resilience of the internet to random breakdowns , 2000, Physical review letters.

[6]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[7]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  C. von Ferber,et al.  TRANSPORTATION NETWORK STABILITY: A CASE STUDY OF CITY TRANSIT , 2012, 1201.5532.

[9]  S. Derrible,et al.  Characterizing metro networks: state, form, and structure , 2010 .

[10]  S. Redner,et al.  Introduction To Percolation Theory , 2018 .

[11]  Albert-László Barabási,et al.  Statistical mechanics of complex networks , 2001, ArXiv.

[12]  Gesine Reinert,et al.  Small worlds , 2001, Random Struct. Algorithms.

[13]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[14]  Reuven Cohen,et al.  Efficient immunization strategies for computer networks and populations. , 2002, Physical review letters.

[15]  Panagiotis Angeloudis,et al.  Large subway systems as complex networks , 2006 .

[16]  Mark E. J. Newman,et al.  Structure and Dynamics of Networks , 2009 .

[17]  Tao Zhou,et al.  Model and empirical study on some collaboration networks , 2006 .

[18]  Hans J. Herrmann,et al.  Mitigation of malicious attacks on networks , 2011, Proceedings of the National Academy of Sciences.

[19]  C. von Ferber,et al.  Scaling in public transport networks , 2005 .

[20]  V. Palchykov,et al.  Public transport networks: empirical analysis and modeling , 2008, 0803.3514.

[21]  J. Hołyst,et al.  Statistical analysis of 22 public transport networks in Poland. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  B. Berche,et al.  Resilience of public transport networks against attacks , 2009, 0905.1638.

[23]  Shlomo Havlin,et al.  Suppressing epidemics with a limited amount of immunization units. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Bei-Bei Su,et al.  Assortativity and act degree distribution of some collaboration networks , 2007 .

[25]  Sybil Derrible,et al.  The complexity and robustness of metro networks , 2010 .

[26]  Sybil Derrible,et al.  Applications of Graph Theory and Network Science to Transit Network Design , 2011 .

[27]  Massimo Marchiori,et al.  Is the Boston subway a small-world network? , 2002 .

[28]  Yurij Holovatch,et al.  Public Transport Networks under Random Failure and Directed Attack , 2010 .

[29]  S. N. Dorogovtsev,et al.  Evolution of networks , 2001, cond-mat/0106144.

[30]  Li Ping,et al.  An evolutionary model of urban bus transport network based on B-space , 2008 .

[31]  V. Latora,et al.  Harmony in the Small-World , 2000, cond-mat/0008357.

[32]  K. Seaton,et al.  Stations, trains and small-world networks , 2003, cond-mat/0311254.

[33]  Yurij Holovatch,et al.  Network harness: Metropolis public transport , 2007 .

[34]  Taras Holovatch Complex transportation networks: resilience, modelling and optimization , 2011 .

[35]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.