2021
DOI: 10.48550/arxiv.2101.03415
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Dynamic optimal transport on networks

Abstract: In this paper we study a dynamical optimal transport problem on a network that allows for transport of mass between different edges if a penalty κ is paid. We show existence of minimisers using duality and discuss the relationships of the distance-functional to other metrics such as the Fisher-Rao and the classical Wasserstein metric and analyse the resulting distance functional in the limiting case κ → ∞.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 16 publications
0
3
0
Order By: Relevance
“…In turn, [1, Lemma 8.2.1] provides the existence of a continuous representative for distributional solutions of continuity equations with velocity fields in L 1 ([0, T ]; L 1 (ρ t )). In particular, for test functions time-independent, we get formulation (3), where we also used that ∇W ε is odd. Note that this formulation overtakes the loss of regularity at 0 for ∇W ε , as already noticed in [8].…”
Section: Definition 22 (Weak Measure Solution To (Nlie)) a Narrowly C...mentioning
confidence: 99%
See 1 more Smart Citation
“…In turn, [1, Lemma 8.2.1] provides the existence of a continuous representative for distributional solutions of continuity equations with velocity fields in L 1 ([0, T ]; L 1 (ρ t )). In particular, for test functions time-independent, we get formulation (3), where we also used that ∇W ε is odd. Note that this formulation overtakes the loss of regularity at 0 for ∇W ε , as already noticed in [8].…”
Section: Definition 22 (Weak Measure Solution To (Nlie)) a Narrowly C...mentioning
confidence: 99%
“…The equation above is also significant in the context of networks, where Wasserstein-type metrics have been derived recently (cf. [3,18]).…”
Section: Further Perspectivesmentioning
confidence: 99%
“…Gradient structures on metric graphs, which can be seen inbetween those of Example A and B are recently studied in [EFMM21,BHP21].…”
Section: Introductionmentioning
confidence: 99%