On the transportation cost norm on finite metric graphs
L’Enseignement Mathématique · 31.07.2026 · 72 (3) · 467-482
DOI: 10.4171/lem/1107 ↗Kurz gefasst
Fachartikel in der Zeitschrift L’Enseignement Mathématique, erschienen am 31.07.2026. Verfasst von Georges Skandalis und 1 weiteren Autor:innen.
Abstract (Originalsprache)
For a finite metric graph X=(V,E,\ell) , where V is endowed with the shortest path metric, we consider the transportation cost problem associated with the distance d on V . Namely, for f a function with total sum 0 on V , write f=\sum_{a,b\in V}P(a,b)(\delta_{a}-\delta_{b}) , where the transportation plan P satisfies P(a,b)\geq 0 for (a,b)\in V\times V . The cost of P is W(P):=\sum_{a,b\in V}P(a,b)d(a,b) and the transportation norm of f is \|f\|_{TC}=\min_{P} W(P) , where P runs over all transportation plans for f .In this semi-survey paper, we give short proofs for the following statements: We use this to reprove known formulae for the transportation norm when X is either a tree or a cycle.
Zitieren
APA
Skandalis, G., & Valette, A. (2026). On the transportation cost norm on finite metric graphs. L’Enseignement Mathématique, 72(3), 467-482. https://doi.org/10.4171/lem/1107
Vancouver
Skandalis G, Valette A. On the transportation cost norm on finite metric graphs. L’Enseignement Mathématique. 2026;72(3):467-482. doi:10.4171/lem/1107
BibTeX
@article{Skandalis2026,
author = {Skandalis, Georges and Valette, Alain},
title = {On the transportation cost norm on finite metric graphs},
journal = {L’Enseignement Mathématique},
year = {2026},
volume = {72},
number = {3},
pages = {467--482},
doi = {10.4171/lem/1107}
}
EUVIMED