Approximation to Probabilities Through Uniform Laws on Convex Sets
J. A. Cuesta-Albertos (),
C. Matrán and
J. Rodríguez-Rodríguez
Additional contact information
J. A. Cuesta-Albertos: Universidad de Cantabria
C. Matrán: Universidad de Valladolid
J. Rodríguez-Rodríguez: Universidad de Valladolid
Journal of Theoretical Probability, 2003, vol. 16, issue 2, 363-376
Abstract:
Abstract Let P be a probability distribution on ∝ d and let $$C$$ be the family of the uniform probabilities defined on compact convex sets of ∝ d with interior non-empty. We prove that there exists a best approximation to P in $$C$$ , based on the L 2-Wasserstein distance. The approximation can be considered as the best representation of P by a convex set in the minimum squares setting, improving on other existent representations for the shape of a distribution. As a by-product we obtain properties related to the limit behavior and marginals of uniform distributions on convex sets which can be of independent interest.
Keywords: Wasserstein distance; uniform laws; convex sets; existence (search for similar items in EconPapers)
Date: 2003
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
http://link.springer.com/10.1023/A:1023518526754 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jotpro:v:16:y:2003:i:2:d:10.1023_a:1023518526754
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10959
DOI: 10.1023/A:1023518526754
Access Statistics for this article
Journal of Theoretical Probability is currently edited by Andrea Monica
More articles in Journal of Theoretical Probability from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().