Weighted complement graphs of spatial networks with functional connections reveal nodes with high potential for new links
Tina \v{S}filigoj, Oded Cats

TL;DR
This paper introduces a method to analyze the potential for new links in public transport networks by constructing weighted complement graphs based on geographical and operational data, revealing spatially central nodes with high link potential.
Contribution
It proposes a novel approach to construct weighted complement graphs for spatial networks, integrating geographical distances and operational constraints to identify nodes with high potential for new connections.
Findings
Weighted complement graphs highlight spatially central nodes lacking topological connectivity.
Testing on 31 metro networks confirms the spatial nature of the observed effects.
Abstract
In this study, we take a systematic look at the unrealised part of public transport networks (PTNs) with functional connections. We consider their complement graphs and study their structure. The complement graph of an unweighted graph is a straightforward concept, yielding a graph on the same set of nodes, and an edge exists in if and only if it is not present in . In contrast, a weighted complement graph cannot be uniquely determined. However, if we consider PTNs with travel times as edge weights, there are physical constraints on the possible weight ranges. We propose a method to construct weighted complement graphs of operational PTN graph representations based on the geographical distances between nodes (representing stops) and assign weights to edges based on distance, combined with network-specific distributions of effective velocities and waiting times.…
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.
