fixed-support-barycenters

A small first attempt at getting Wasserstein barycenters working on graphs: the Sinkhorn algorithm of Bonneel et al. (2016), using graph distance matrices as the cost matrix. It works reasonably well, but has a real theoretical issue — the set of distance matrices is not isomorphic to the set of weighted graphs, so treating graph distance as an arbitrary cost matrix loses structure that the later, graph-native methods in GraphTransportation.jl recover.

• Code: github.com/dcgentile/fixed-support-barycenters
• Paper: Regularized 2-Wasserstein Barycenters on Discrete Metric Spaces (SampTA 2025)