Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-17T06:02:34.693Z Has data issue: false hasContentIssue false

Uniform decomposition of probability measures: quantization, clustering and rate of convergence

Published online by Cambridge University Press:  16 January 2019

Julien Chevallier*
Affiliation:
Université Grenoble Alpes
*
* Postal address: Université Grenoble Alpes, CNRS, LJK, 38000 Grenoble, France. Email address: julien.chevallier1@univ-grenoble-alpes.fr
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

The study of finite approximations of probability measures has a long history. In Xu and Berger (2017), the authors focused on constrained finite approximations and, in particular, uniform ones in dimension d=1. In the present paper we give an elementary construction of a uniform decomposition of probability measures in dimension d≥1. We then use this decomposition to obtain upper bounds on the rate of convergence of the optimal uniform approximation error. These bounds appear to be the generalization of the ones obtained by Xu and Berger (2017) and to be sharp for generic probability measures.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 2018