A discrete Benamou-Brenier formulation of Optimal Transport on graphs
Abstract
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.
Fields of Study & Subjects
Geometric Analysis and Curvature Flows
Nonlinear Partial Differential Equations
Numerical methods in inverse problems
Publication details
- Pages
- 1–6
- Publication date
- 1 June 2026
- Language
- EN