Optimal paths on the road network as directed polymers
Abstract
We analyze the statistics of the shortest and fastest paths on the road network between randomly sampled end points. To a good approximation, these optimal paths are found to be directed in that their lengths (at large scales) are linearly proportional to the absolute distance between them. This motivates comparisons to universal features of directed polymers in random media. There are similarities in scalings of fluctuations in length/time and transverse wanderings, but also important distinctions in the scaling exponents, likely due to long-range correlations in geographic and man-made features. At short scales the optimal paths are not directed due to circuitous excursions governed by a fat-tailed (power-law) probability distribution.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.