Uniqueness and approximate computation of optimal incomplete transportation plans

DOI10.1214/09-AIHP354zbMath1215.49042OpenAlexW2124715517MaRDI QIDQ537127

Carlos Matrán, Juan Antonio Cuesta-Albertos, Eustasio del Barrio, Pedro C. Álvarez-Esteban

Publication date: 19 May 2011

Published in: Annales de l'Institut Henri Poincaré. Probabilités et Statistiques (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/242550

zbMATH Keywords

uniquenesssimilaritytrimmingmultivariate distributionsoptimal transportation planCLTtrimmed probabilityincomplete mass transportation problem

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Optimal stochastic control (93E20) Probabilistic measure theory (60A10) Convergence of probability measures (60B10) Integration and disintegration of measures (28A50)

Related Items (17)

Searching for a common pooling pattern among several samples ⋮ A fixed-point approach to barycenters in Wasserstein space ⋮ Box-constrained monotone approximations to Lipschitz regularizations, with applications to robust testing ⋮ A contamination model for the stochastic order ⋮ The empirical cost of optimal incomplete transportation ⋮ On approximate validation of models: a Kolmogorov-Smirnov-based approach ⋮ A central limit theorem for Wasserstein type distances between two distinct univariate distributions ⋮ Trimmed regions induced by parameters of a probability ⋮ Similarity of samples and trimming ⋮ Generalized Wasserstein barycenters between probability measures living on different subspaces ⋮ Rates of convergence for partial mass problems ⋮ Wide consensus aggregation in the Wasserstein space. Application to location-scatter families ⋮ Characterization of barycenters in the Wasserstein space by averaging optimal transport maps ⋮ Fréchet means and Procrustes analysis in Wasserstein space ⋮ Procrustes metrics on covariance operators and optimal transportation of Gaussian processes ⋮ On the analysis of adaptability in multi-source domain adaptation ⋮ Distributionally robust stochastic programs with side information based on trimmings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The optimal partial transport problem
• Consistency of the \(\alpha \)-trimming of a probability. Applications to central regions
• Some asymptotic theory for the bootstrap
• Best approximations to random variables based on trimming procedures
• Notes on the Wasserstein metric in Hilbert spaces
• A characterization of random variables with minimum \(L^ 2\)-distance
• Optimal transportation plans and convergence in distribution
• On the monotonicity of optimal transportation plans
• Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
• Uniqueness and transport density in Monge's mass transportation problem
• Existence and uniqueness of monotone measure-preserving maps
• Weak convergence and empirical processes. With applications to statistics
• On the stochastic convergence of representations based on Wasserstein metrics
• Integral trimmed regions
• Constructing optimal maps for Monge’s transport problem as a limit of strictly convex costs
• Polar factorization and monotone rearrangement of vector‐valued functions
• Shape recognition via Wasserstein distance

This page was built for publication: Uniqueness and approximate computation of optimal incomplete transportation plans