Papers › How much longer do you have to drive than the crow has to fly?
How much longer do you have to drive than the crow has to fly?
Shanshan Wang, Henrik M. Bette, Michael Schreckenberg, Thomas Guhr
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
When traveling by car from one location to another, our route is constrained by the road network. The network distance between the two locations is generally longer than the geodetic distance as the crow flies. We report a systematic relation between the statistical properties of these two distances. Empirically, we find a robust scaling between network and geodetic distance distributions for a variety of large motorway networks. A simple consequence is that we typically have to drive 1.3±0.1 times longer than the crow flies. This scaling is not present in standard random networks; rather, it requires non-random adjacency. We develop a set of rules to build a realistic motorway network, also consistent with the above scaling. We hypothesize that the scaling reflects a compromise between two societal needs: high efficiency and accessibility on the one hand, and limitation of costs and other burdens on the other.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections