Resilience analytics: coverage and robustness in multi-modal transportation networks

A multi-modal transportation system of a city can be modeled as a multiplex network with different layers corresponding to different transportation modes. These layers include, but are not limited to, bus network, metro network, and road network. Formally, a multiplex network is a multilayer graph in which the same set of nodes are connected by different types of relationships. Intra-layer relationships denote the road segments connecting stations of the same transportation mode, whereas inter-layer relationships represent connections between different transportation modes within the same station. Given a multi-modal transportation system of a city, we are interested in assessing its quality or efficiency by estimating the coverage i.e., a portion of the city that can be covered by a random walker who navigates through it within a given time budget, or steps. We are also interested in the robustness of the whole transportation system which denotes the degree to which the system is able to withstand a random or targeted failure affecting one or more parts of it. Previous approaches proposed a mathematical framework to numerically compute the coverage in multiplex networks. However solutions are usually based on eigenvalue decomposition, known to be time consuming and hard to obtain in the case of large systems. In this work, we propose MUME, an efficient algorithm for Multi-modal Urban Mobility Estimation, that takes advantage of the special structure of the supra-Laplacian matrix of the transportation multiplex, to compute the coverage of the system. We conduct a comprehensive series of experiments to demonstrate the effectiveness and efficiency of MUME on both synthetic and real transportation networks of various cities such as Paris, London, New York and Chicago. A future goal is to use this experience to make projections for a fast growing city like Doha.

[1]  J. Klafter,et al.  First-passage times in complex scale-invariant media , 2007, Nature.

[2]  Martin Catala,et al.  Expanding the Google Transit Feed Specification to Support Operations and Planning , 2011 .

[3]  Albert Solé-Ribalta,et al.  Navigability of interconnected networks under random failures , 2013, Proceedings of the National Academy of Sciences.

[4]  Massimo Marchiori,et al.  Error and attacktolerance of complex network s , 2004 .

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

[6]  D. West Introduction to Graph Theory , 1995 .

[7]  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.

[8]  Raissa M. D'Souza,et al.  Coupled catastrophes: sudden shifts cascade and hop among interdependent systems , 2014, Journal of The Royal Society Interface.

[9]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[10]  Harry Eugene Stanley,et al.  Catastrophic cascade of failures in interdependent networks , 2009, Nature.

[11]  Conrado J. Pérez Vicente,et al.  Diffusion dynamics on multiplex networks , 2012, Physical review letters.

[12]  Ginestra Bianconi,et al.  Weighted Multiplex Networks , 2013, PloS one.

[13]  J. Spencer,et al.  Explosive Percolation in Random Networks , 2009, Science.

[14]  M. Johnson,et al.  Circulating microRNAs in Sera Correlate with Soluble Biomarkers of Immune Activation but Do Not Predict Mortality in ART Treated Individuals with HIV-1 Infection: A Case Control Study , 2015, PloS one.

[15]  Heiko Rieger,et al.  Random walks on complex networks. , 2004, Physical review letters.

[16]  Yamir Moreno,et al.  Lévy random walks on multiplex networks , 2016, Scientific Reports.

[17]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[18]  Shyamolina Ghosh,et al.  Selecting spatio-temporal patterns by substrate injection in a reaction-diffusion system , 2015 .

[19]  Daniel Delling,et al.  Round-Based Public Transit Routing , 2015 .

[20]  Jon M. Kleinberg,et al.  Social Networks Under Stress , 2016, WWW.

[21]  S Shai,et al.  Coupled adaptive complex networks. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[22]  Kwang-Il Goh,et al.  Towards real-world complexity: an introduction to multiplex networks , 2015, ArXiv.

[23]  Sergio Gómez,et al.  Centrality rankings in multiplex networks , 2014, WebSci '14.

[24]  Yunpeng Wang,et al.  Percolation transition in dynamical traffic network with evolving critical bottlenecks , 2014, Proceedings of the National Academy of Sciences.

[25]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[26]  L. D. Costa,et al.  Exploring complex networks through random walks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[27]  Tamara G. Kolda,et al.  Multilinear Algebra for Analyzing Data with Multiple Linkages , 2006, Graph Algorithms in the Language of Linear Algebra.

[28]  A. Arenas,et al.  Multiplex social ecological network analysis reveals how social changes affect community robustness more than resource depletion , 2016, Proceedings of the National Academy of Sciences.

[29]  Mason A. Porter,et al.  Author Correction: The physics of spreading processes in multilayer networks , 2016, 1604.02021.

[30]  Jimeng Sun,et al.  Beyond streams and graphs: dynamic tensor analysis , 2006, KDD '06.

[31]  Peter Grassberger,et al.  Percolation theory on interdependent networks based on epidemic spreading , 2011, 1109.4447.

[32]  Jiaqiu Wang,et al.  Resilience of Self-Organised and Top-Down Planned Cities—A Case Study on London and Beijing Street Networks , 2015, PloS one.

[33]  Sergio Gómez,et al.  Congestion induced by the structure of multiplex networks , 2016, Physical review letters.

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

[35]  E A Leicht,et al.  Suppressing cascades of load in interdependent networks , 2011, Proceedings of the National Academy of Sciences.

[36]  Jaideep Srivastava,et al.  A Multiplex Approach to Urban Mobility , 2016, COMPLEX NETWORKS.

[37]  Tahar Zanouda,et al.  Robustness and Resilience of cities around the world , 2016, ArXiv.

[38]  Jurgen Kurths,et al.  Synchronization in complex networks , 2008, 0805.2976.

[39]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[40]  S. N. Dorogovtsev,et al.  Multiple percolation transitions in a configuration model of a network of networks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  Mason A. Porter,et al.  Multilayer Analysis and Visualization of Networks , 2014, J. Complex Networks.

[42]  M. Batty,et al.  Cities and regions in Britain through hierarchical percolation , 2015, Royal Society Open Science.

[43]  Yamir Moreno,et al.  A Multilayer perspective for the analysis of urban transportation systems , 2016, Scientific Reports.

[44]  Vito Latora,et al.  Structural reducibility of multilayer networks , 2015, Nature Communications.

[45]  Marc Barthelemy,et al.  Multiplex networks in metropolitan areas: generic features and local effects , 2015, Journal of The Royal Society Interface.

[46]  Sergio Gómez,et al.  Ranking in interconnected multilayer networks reveals versatile nodes , 2015, Nature Communications.

[47]  K-I Goh,et al.  Network robustness of multiplex networks with interlayer degree correlations. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[48]  Z. Struzik,et al.  Temporal condensation and dynamic λ-transition within the complex network: an application to real-life market evolution , 2015 .

[49]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[50]  Daqing Li,et al.  Robustness of networks with dependency topology , 2017 .

[51]  Sergio Gómez,et al.  Spectral properties of the Laplacian of multiplex networks , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[53]  A. Arenas,et al.  Mathematical Formulation of Multilayer Networks , 2013, 1307.4977.

[54]  Wolfgang Scherr,et al.  Development of a Regional Forecasting Model Based on Google Transit Feed , 2012 .

[55]  Shan Jiang,et al.  Demand and Congestion in Multiplex Transportation Networks , 2016, PloS one.

[56]  Magnus Egerstedt,et al.  Robust Graph Topologies for Networked Systems , 2012 .

[57]  Sergio Gómez,et al.  Explosive synchronization transitions in scale-free networks. , 2011, Physical review letters.

[58]  Shichao Yang Exploring complex networks by walking on them. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[59]  Sergio Gómez,et al.  Random walk centrality in interconnected multilayer networks , 2015, ArXiv.

[60]  James Wong,et al.  Leveraging the General Transit Feed Specification for Efficient Transit Analysis , 2013 .

[61]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[62]  Z. Wang,et al.  The structure and dynamics of multilayer networks , 2014, Physics Reports.