Access graph: a novel graph representation of public transport networks for accessibility analysis
Tina \v{S}filigoj, Aljo\v{s}a Peperko, Oded Cats

TL;DR
This paper introduces the Access Graph, a new graph-based method for analyzing public transport accessibility by modeling travel times between nodes, enabling comprehensive assessment of network performance and equity.
Contribution
The paper presents the Access Graph, a novel unified framework for accessibility analysis in public transport networks based on generalized travel times and threshold-dependent node degrees.
Findings
Access Graph effectively models accessibility within a specified time budget.
Degree distribution analysis reveals network performance and accessibility saturation points.
Application to 51 metro networks demonstrates the method's scalability and insights into access equity.
Abstract
Accessibility, defined as travel impedance between spatially dispersed opportunities for activity, is one of the main determinants of public transport use. In-depth understanding of its properties is crucial for optimal public transport systems planning and design. Although the concept has been around for decades and there is a large body of literature on accessibility operationalisation and measurement, a unified approach is lacking. To this end, we introduce a novel graph representation of public transport networks, termed the Access Graph, or A-space, based on the generalised travel times between nodes. We introduce an edge between two nodes in the access graph if the travel time between them is below a certain threshold time budget. In this representation, node degree directly measures the number of nodes reachable within a predetermined time, reproducing the cumulative…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
