Abstract
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich problem. These models are more realistic as they predict the observed branching structure of communication networks. They also define new distances between measures. The question arises of how these distances compare to the classical Wasserstein distance obtained from the Monge-Kantorovich problem. In this work we show sharp inequalities between the dα distance induced by branching transport paths and the classical Wasserstein distance over probability measures in a compact domain of Rm. © 2006 Elsevier Ltd. All rights reserved.
| Original language | English |
|---|---|
| Pages (from-to) | 427-432 |
| Number of pages | 6 |
| Journal | Applied Mathematics Letters |
| Volume | 20 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Apr 2007 |
| Externally published | Yes |
Keywords
- Branched transportation networks
- Sharp inequalities
- Wasserstein distance
Fingerprint
Dive into the research topics of 'Comparison of distances between measures'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver