mlsanityData to 14 Oct 2026

A discrete Benamou-Brenier formulation of Optimal Transport on graphs

arXiv 2601.04193 ↗First posted 7 Jan 2026cs.IT math.IT math.PRcited by 0

Not on the map. Why?

Abstract (arXiv)

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 W1 geodesics on graphs.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 21 references that are in the map. First posted on arXiv 7 Jan 2026.

Builds on

4 of 21 references.

References · 4

  1. 2018Computational Optimal Transportcited by 780
  2. 2015Learning with a Wasserstein Losscited by 196
  3. 2021Large-Scale Wasserstein Gradient Flowscited by 77
  4. 2019Wasserstein Dependency Measure for Representation Learningcited by 69

Built on by

Not cited yet.