Approximation of Discrete Measures by Finite Point Sets

For a probability measure on [0, 1] without discrete component, the best possible order of approximation by a finite point set in terms of the star-discrepancy is &inline as has been proven relatively recently. However, if contains a discrete component no non-trivial lower bound holds in general...

Full description

Saved in:
Bibliographic Details
Published inUniform distribution theory Vol. 18; no. 1; pp. 31 - 38
Main Author Weiss, Christian
Format Journal Article
LanguageEnglish
Published Liverpool Sciendo 01.07.2023
De Gruyter Brill Sp. z o.o., Paradigm Publishing Services
Subjects
Online AccessGet full text
ISSN2309-5377
1336-913X
2309-5377
DOI10.2478/udt-2023-0003

Cover

More Information
Summary:For a probability measure on [0, 1] without discrete component, the best possible order of approximation by a finite point set in terms of the star-discrepancy is &inline as has been proven relatively recently. However, if contains a discrete component no non-trivial lower bound holds in general because it is straightforward to construct examples without any approximation error in this case. This might explain, why the approximation of discrete measures on [0, 1] by finite point sets has so far not been completely covered in the existing literature. In this note, we close the gap by giving a complete description for discrete measures. Most importantly, we prove that for any discrete measures (not supported on one point only) the best possible order of approximation is for infinitely many bounded from below by &inline for some constant 6 ≥ 2 which depends on the measure. This implies, that for a finitely supported discrete measure on [0, 1] the known possible order of approximation &inline is indeed the optimal one.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2309-5377
1336-913X
2309-5377
DOI:10.2478/udt-2023-0003