Papers
Topics
Authors
Recent
Search
2000 character limit reached

Dynamic optimal transport on networks

Published 9 Jan 2021 in math.AP | (2101.03415v2)

Abstract: We study a dynamic optimal transport problem on a network. Despite the cost for transport along the edges, an additional cost, scaled with a parameter κ\kappa, has to be paid for interchanging mass between edges and vertices. We show existence f minimisers using duality and discuss the relationship of the model to other metrics such as Fisher-Rao and the classical Wasserstein metric. Finally, we examine the limiting behaviour of the model in terms of the parameter κ\kappa.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.