2020/08/27 by Kiderlen, Markus, Pausinger, Florian · 2 citations
#11K38 #FOS: Mathematics #Number Theory (math.NT) #Probability (math.PR) #Statistics Theory (math.ST)
paper · doi:10.48550/arxiv.2008.12026
We extend the notion of jittered sampling to arbitrary partitions and study the discrepancy of the related point sets. Let \mathbfΩ=(Ω1,…,ΩN) be a partition of [0,1]d and let the ith point in P be chosen uniformly in the ith set of the partition (and stochastically independent of the other points), i=1,…,N. For the study of such sets we introduce the concept of a uniformly distributed triangular array and compare this notion to related notions in the literature. We prove that the expected Lp-discrepancy, 𝔼 Lp(P\mathbfΩ)p, of a point set P_\mathbfΩ generated from any equivolume partition \mathbfΩ is always strictly smaller than the expected Lp-discrepancy of a set of N uniform random samples for p>1. For fixed N we consider classes of stratified samples based on equivolume partitions of the unit cube into convex sets or into sets with a uniform positive lower bound on their reach. It is shown that these classes contain at least one minimizer of the expected Lp-discrepancy. We illustrate our results with explicit constructions for small N. In addition, we present a family of partitions that seems to improve the expected discrepancy of Monte Carlo sampling by a factor of 2 for every N.