Access graph: a novel graph representation of public transport networks for accessibility analysis (2507.08361v1)

Abstract: Accessibility, defined as travel impedance between spatially dispersed opportunities for activity, is one of the main determinants of public transport (PT) 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, based on the shortest paths between nodes. Shortest paths are calculated using the in-vehicle time-weighted L- and frequency-weighted P-space representations to determine generalised travel times. Then there is 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. We study the threshold-dependent evolution of the access graph, focusing on average degree and degree distributions. Based on the topological properties of the access graph, we define a set of accessibility indicators. In addition, we propose indicators of access equity. We apply the methodology to a dataset of 51 metro networks worldwide. In all cases, a logistic-like growth of average degree with time budget is observed, indicating universal behaviour of accessibility and exhibiting the value of the proposed representation for unified accessibility studies and its potential for comparative analyses. We see a great potential for the access graph to drive in-depth studies of accessibility.