Absence of loops for the Wasserstein-$\mathcal{H}^1$ problem: the concentration/blow-up argument
Jo{\~a}o Miguel Machado (LMCRC)

TL;DR
This paper proves that minimizers of a specific Wasserstein problem are trees under certain conditions, advancing understanding of optimal transport structures.
Contribution
It establishes that minimizers are trees for the Wasserstein-$\
Findings
Minimizers are trees when the target measure is finitely supported.
Minimizers are trees when the target measure has a bounded density.
Abstract
In the present work we prove that minimizers of the Wasserstein- problem, introduced recently by Chambolle et. al., are trees in two cases: when the target measure is a sum of finitely many Dirac masses or when it has a bounded density.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
