arXiv · 2601.14457
p-Wasserstein distances on networks and 3D to 1D convergence
Abstract
We study transport distances on metric graphs representing gas networks. Starting from the dynamic formulation of the Wasserstein distance, we review extensions to networks, with and without the possibility of storing mass on the vertices. Next, we examine the asymptotic behavior of the static Wasserstein distance on a three-dimensional network domain that converges to a metric graph. We show convergence of the distance with a proof that is based on the characterization of optimal transport plans as $c$-cyclically monotone sets. We conclude by illustrating our finding with several numerical examples.
Explore related subjects
Keep this discovery
Martin Burger, Ariane Fazeny, Gilles Mordant, Jan-Frederik Pietschmann. 2026-01-20. p-Wasserstein distances on networks and 3D to 1D convergence. https://arxiv.org/abs/2601.14457
Cite the original work for its findings. Save a collection to share your selection of sources.