Families of well approximable measures

From MaRDI portal
Publication:2129358

DOI10.2478/UDT-2021-0003zbMATH Open1489.11109arXiv2003.13122OpenAlexW3210336966MaRDI QIDQ2129358FDOQ2129358

Max Goering, Christian Weiß, Samantha Fairchild

Publication date: 22 April 2022

Published in: Uniform distribution theory (Search for Journal in Brave)

Abstract: We provide an algorithm to approximate a finitely supported discrete measure mu by a measure uN corresponding to a set of N points so that the total variation between mu and uN has an upper bound. As a consequence if mu is a (finite or infinitely supported) discrete probability measure on [0,1]d with a sufficient decay rate on the weights of each point, then mu can be approximated by uN with total variation, and hence star-discrepancy, bounded above by (logN)N1. Our result improves, in the discrete case, recent work by Aistleitner, Bilyk, and Nikolov who show that for any normalized Borel measure mu, there exist finite sets whose star-discrepancy with respect to mu is at most (logN)dfrac12N1. Moreover we close a gap in the literature for discrepancy in the case d=1 showing both that Lebesgue is indeed the hardest measure to approximate by finite sets and also that all measures without discrete components have the same order of discrepancy as the Lebesgue measure.


Full work available at URL: https://arxiv.org/abs/2003.13122





Cites Work


Cited In (6)






This page was built for publication: Families of well approximable measures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2129358)