Optimal Transportation Plans and Convergence in Distribution
Explicit expression of mappings optimal transportation plans for the Wasserstein distance in p,p>1, are not generally available. Therefore, it is of great interest to provide results which justify the practical use of simulation techniques to obtain approximate optimal transportation plans. This is done in this paper, where we obtain the consistency of the empirical optimal transportation plans. Our results can also be employed to justify a definition of multidimensional complete dependence.
Year of publication: |
1997
|
---|---|
Authors: | Cuesta-Albertos, J. A. ; Matrán, C. ; Tuero-Diaz, A. |
Published in: |
Journal of Multivariate Analysis. - Elsevier, ISSN 0047-259X. - Vol. 60.1997, 1, p. 72-83
|
Publisher: |
Elsevier |
Keywords: | Wasserstein distance Monge-Kantorovich transportation problem optimal transportation plans convergence in distribution consistency maximal monotone operators monotone dependence Skorohod almost sure representation |
Saved in:
Saved in favorites
Similar items by person
-
Robust estimation in the normal mixture model based on robust clustering
Cuesta-Albertos, J. A., (2008)
-
Trimmed best k-nets: A robustified version of an L[infinity]-based clustering method
Cuesta-Albertos, J. A., (1998)
-
Searching for a common pooling pattern among several samples
Álvarez-Esteban, P.C., (2013)
- More ...