Network harness: bundles of routes in public transport networks
B. Berche, C. von Ferber, T. Holovatch

TL;DR
This paper introduces the concept of network harness to analyze public transport routes sharing street and track segments, revealing organizational patterns through power-law distributions and comparing real networks with random models.
Contribution
It proposes the harness distribution as a new measure for understanding route parallelism and organization in public transport networks, supported by empirical data and model comparisons.
Findings
Harness distribution follows power laws in real PTNs
Real PTNs deviate from random route models
Organization driven by cost minimization and urban clustering
Abstract
Public transport routes sharing the same grid of streets and tracks are often found to proceed in parallel along shorter or longer sequences of stations. Similar phenomena are observed in other networks built with space consuming links such as cables, vessels, pipes, neurons, etc. In the case of public transport networks (PTNs) this behavior may be easily worked out on the basis of sequences of stations serviced by each route. To quantify this behavior we use the recently introduced notion of network harness. It is described by the harness distribution P(r,s): the number of sequences of s consecutive stations that are serviced by r parallel routes. For certain PTNs that we have analyzed we observe that the harness distribution may be described by power laws. These power laws observed indicate a certain level of organization and planning which may be driven by the need to minimize the…
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.
