Structure and robustness of Sao Paulo public transport network

Public Transport Networks plays a central role in cities devolopment. In big cities such system may be represented by a complex network and understand its properties is of great interest for managers and scholars. In this work, the urban public transport system of Sao Paulo is reinterpreted as a coupled (bus, subway and train) network, bypassing operational details and focusing on connectivity. Using a empirically generated graph, a statistical characterization is made by network metrics. Nearby bus stops and rail transport stations (subway and train) may or may not be considered as a single vertex in the network representation of the transport system, depending on how much an user is willing to walk to shift from one stop/station to another. This distance radius is then used to group nearby stops/stations as a single vertex in the network representation of the urban public transport system and then its properties are studied as a function of this radius. This radius is used as proxy of the user's willingness to walk until the nearest point to access transportation. The variation of the measure $ \rho $ leads to changes in the perception of the topology of the public transport network as shown in this work. An interesting result was that the network is assortative. Another aspect investigated was the degree distribution of the network. It was not possible to distinguish between power-law or a log-normal distribution. An exploratory model is used to test the robustness of the network by randomly, deterministically and preferentially targeting the stops and service lines. According to the grouping radius, aka willingness, different fragmentation values were obtained under attack simulations. We showed that increasing this willingness generates great reduction in the number of necessary jumps between buses, subway and trains lines to achieve all the network destinations.

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

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

[3]  M. Newman,et al.  Mixing patterns in networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[5]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[6]  Qing Xu,et al.  Space P-Based Empirical Research on Public Transport Complex Networks in 330 Cities of China , 2013 .

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

[8]  Paul Erdös,et al.  On random graphs, I , 1959 .

[9]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

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

[11]  A. Barabasi,et al.  Scale-free characteristics of random networks: the topology of the world-wide web , 2000 .

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

[13]  Yang Yang,et al.  Statistic properties and cascading failures in a coupled transit network consisting of bus and subway systems , 2014 .

[14]  M. Batty The New Science of Cities , 2013 .

[15]  K. Gurney,et al.  Network ‘Small-World-Ness’: A Quantitative Method for Determining Canonical Network Equivalence , 2008, PloS one.

[16]  Yurij Holovatch,et al.  A tale of two cities. Vulnerabilities of the London and Paris transit networks , 2012, ArXiv.

[17]  Segun Goh,et al.  Emergence of Criticality in the Transportation Passenger Flow: Scaling and Renormalization in the Seoul Bus System , 2014, PloS one.

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

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

[20]  Yang Yang,et al.  Cascading Failures in Weighted Complex Networks of Transit Systems Based on Coupled Map Lattices , 2015 .

[21]  Inanç Birol,et al.  Hive plots - rational approach to visualizing networks , 2012, Briefings Bioinform..

[22]  Juan Carlos García-Palomares,et al.  Measuring the vulnerability of public transport networks , 2014 .

[23]  D. Plenz,et al.  powerlaw: A Python Package for Analysis of Heavy-Tailed Distributions , 2013, PloS one.

[24]  Ke Ma,et al.  Power law and small world properties in a comparison of traffic city networks , 2011 .

[25]  C. von Ferber,et al.  Attack Vulnerability of Public Transport Networks , 2007, 0709.3206.

[26]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.