Dynamic Optimal Transport on Networks
From MaRDI portal
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 , 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 .
Recommendations
Cites work
- \{Euclidean, metric, and Wasserstein\} gradient flows: an overview
- A computational fluid mechanics solution to the Monge-Kantorovich mass transfer problem
- A new optimal transport distance on the space of finite Radon measures
- A new transportation distance with bulk/interface interactions and flux penalization
- A survey on dynamical transport distances
- An interpolating distance between optimal transport and Fisher-Rao metrics
- Convex Analysis
- Duality and stability in extremum problems involving convex functions
- Entropy-preserving coupling of hierarchical gas models
- Flows on networks: recent results and perspectives
- Gas flow in pipeline networks
- Generalized Wasserstein distance and its application to transport equations with source
- Gradient flow formulation of diffusion equations in the Wasserstein space over a metric graph
- Gradient flows in metric spaces and in the space of probability measures
- scientific article; zbMATH DE number 1909499 (Why is no real title available?)
- Integrals which are convex functionals. II
- Metrics for Power Spectra: An Axiomatic Approach
- New lower semicontinuity results for nonconvex functionals defined on measures
- Nonlinear mobility continuity equations and generalized displacement convexity
- On a class of modified Wasserstein distances induced by concave mobility functions defined on bounded intervals
- On the role of vesicle transport in neurite growth: modeling and experiments
- Optimal entropy-transport problems and a new Hellinger-Kantorovich distance between positive measures
- Optimal mass transport on metric graphs
- Optimal transport for applied mathematicians. Calculus of variations, PDEs, and modeling
- Optimal transport in competition with reaction: the Hellinger-Kantorovich distance and geodesic curves
- Unbalanced optimal transport: dynamic and Kantorovich formulations
Cited in
(5)- Generalized network transport and Euler-Hille formula
- Approximate Wasserstein attraction flows for dynamic mass transport over networks
- Optimal mass transport on metric graphs
- Optimal transport and minimal trade problem, impacts on relational metrics and applications to large graphs and networks modularity
- Optimal transport on gas networks
This page was built for publication: Dynamic Optimal Transport on Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138483)