Score: 0
A discrete Benamou-Brenier formulation of Optimal Transport on graphs
Published: January 7, 2026 |
arXiv ID: 2601.04193v1
By: Kieran Morris, Oliver Johnson
Potential Business Impact:
Finds shortest paths on networks for data.
Business Areas:
Transportation
Transportation
We propose a discrete transport equation on graphs which connects distributions on both vertices and edges. We then derive a discrete analogue of the Benamou-Brenier formulation for Wasserstein-$1$ distance on a graph and as a result classify all $W_1$ geodesics on graphs.
Similar Papers
89%
Dynamic characterization of barycentric optimal transport problems and their martingale relaxation
Probability
Finds new ways to move data smoothly.
26 Nov 2025
0
88%
Vector valued optimal transport: from dynamic to static formulations
Analysis of PDEs
Unifies math for complex problems, speeding up calculations.
6 May 2025
0
88%
On a $T_1$ Transport inequality for the adapted Wasserstein distance
Probability
Helps computers understand how things change over time.
25 Jul 2025
0
Country of Origin
🇬🇧
United Kingdom
Page Count
9 pages
Category
Computer Science:
Information Theory