Best finite constrained approximations of one-dimensional probabilities

Chuang Xu, Arno Berger*

*Corresponding author for this work
2 Citations (Scopus)

Abstract

This paper studies best finitely supported approximations of one-dimensional probability measures with respect to the L r -Kantorovich (or transport) distance, where either the locations or the weights of the approximations’ atoms are prescribed. Necessary and sufficient optimality conditions are established, and the rate of convergence (as the number of atoms goes to infinity) is discussed. In view of emerging mathematical and statistical applications, special attention is given to the case of best uniform approximations (i.e., all atoms having equal weight). The approach developed in this paper is elementary; it is based on best approximations of (monotone) L r -functions by step functions, and thus different from, yet naturally complementary to, the classical Voronoi partition approach.

Original languageEnglish
JournalJournal of Approximation Theory
Volume244
Pages (from-to)1-36
Number of pages36
ISSN0021-9045
DOIs
Publication statusPublished - 2019

Keywords

  • Asymptotically best approximation
  • Balanced function
  • Best uniform approximation
  • Constrained approximation
  • Kantorovich distance
  • Quantile function

Fingerprint

Dive into the research topics of 'Best finite constrained approximations of one-dimensional probabilities'. Together they form a unique fingerprint.

Cite this