Preprint
Aug 2026
Computing All Optimal Partial $p$-Wasserstein Matchings on the Line
For $p \ge 1$, the $p$-Wasserstein distance measures the minimum cost of transporting probability mass between distributions, where moving unit mass between two points costs the $p$th power of their distance. For discrete distributions in one dimension, full transport is especially simple: after sorting, mass is matche...
Sebastian Angrick, Jacobus Conradi, Mónika Csikós et al.
· 0 citations