Graph Theory and Metro Traffic Modelling
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:PSTMZEWHrecord.jsonopen to challenge →
classification
eess.SP
cs.ITmath.ITphysics.soc-ph
keywords
networkundergroundgraphlondontheorytrafficacrossanalyse
read the original abstract
In this article we demonstrate how graph theory can be used to identify those stations in the London underground network which have the greatest influence on the functionality of the traffic, and proceed, in an innovative way, to assess the impact of a station closure on service levels across the city. Such underground network vulnerability analysis offers the opportunity to analyse, optimize and enhance the connectivity of the London underground network in a mathematically tractable and physically meaningful manner.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.