Research PaperResearchia:202601.072d7682
A discrete Benamou-Brenier formulation of Optimal Transport on graphs
Kieran Morris
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.
Submitted: January 7, 2026Subjects: Data Science; Data Science
Description / Details
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- distance on a graph and as a result classify all geodesics on graphs.
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Access Paper
Submission Info
Date:
Jan 7, 2026
Jan 7, 2026
Topic:
Data Science
Data Science
Area:
Data Science
Data Science
Comments:
0
0
Bookmark