On the Structure of Unique Shortest Paths in Graphs
Greg Bodwin

TL;DR
This paper characterizes which sets of node sequences can be realized as unique shortest paths in graphs with real weights, introducing forbidden intersection patterns and connecting shortest path structures to topology.
Contribution
It provides a new characterization of strongly metrizable path systems using forbidden patterns and links shortest paths to topological structures.
Findings
Characterization of strongly metrizable path systems via forbidden patterns
Connection between shortest paths and topology using 2-manifolds
Structural corollaries suggesting deep links between graph theory and topology
Abstract
This paper develops a structural theory of unique shortest paths in real-weighted graphs. Our main goal is to characterize exactly which sets of node sequences, which we call path systems, can be realized as unique shortest paths in a graph with arbitrary real edge weights. We say that such a path system is strongly metrizable. An easy fact implicit in the literature is that a strongly metrizable path system must be consistent, meaning that no two of its paths may intersect, split apart, and then intersect again. Our main result characterizes strong metrizability via some new forbidden intersection patterns along these lines. In other words, we describe a family of forbidden patterns beyond consistency, and we prove that a path system is strongly metrizable if and only if it is consistent and it avoids all of the patterns in this family. We offer separate (but closely related)…
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.
Taxonomy
TopicsTopological and Geometric Data Analysis · Advanced Graph Theory Research · Mathematical Dynamics and Fractals
