Papers
Topics
Authors
Recent
2000 character limit reached

Map-compatible decomposition of transport paths (2310.03825v1)

Published 5 Oct 2023 in math.AP and math.OC

Abstract: In the Monge-Kantorovich transport problem, the transport cost is expressed in terms of transport maps or transport plans, which play crucial roles there. A variant of the Monge-Kantorovich problem is the ramified (branching) transport problem that models branching transport systems via transport paths. In this article, we showed that any cycle-free transport path between two atomic measures can be decomposed into the sum of a map-compatible path and a plan-compatible path. Moreover, we showed that each stair-shaped transport path can be decomposed into the difference of two map-compatible transport paths.

Summary

We haven't generated a summary for this paper yet.

Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

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

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.