Pith. sign in

REVIEW

Graph Theory and Metro Traffic Modelling

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.05964 v1 pith:PSTMZEWH submitted 2019-12-12 eess.SP cs.ITmath.ITphysics.soc-ph

Bruno Scalzo Dees , Anthony G. Constantinides , Danilo P. Mandic This is my paper · ORCID
classification eess.SPcs.ITmath.ITphysics.soc-ph
keywords networkundergroundgraphlondontheorytrafficacrossanalyse
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
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.

Discussion (0). Continue with ORCID to comment.

Pith tools