A discrete Benamou-Brenier formulation of Optimal Transport on graphs
Kieran Morris, Oliver Johnson
paper2026-01-07English
Description
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.