Discrepancy Bounds for a Class of Negatively Dependent Random Points Including Latin Hypercube Samples

02/06/2021
by   Michael Gnewuch, et al.
0

We introduce a class of γ-negatively dependent random samples. We prove that this class includes, apart from Monte Carlo samples, in particular Latin hypercube samples and Latin hypercube samples padded by Monte Carlo. For a γ-negatively dependent N-point sample in dimension d we provide probabilistic upper bounds for its star discrepancy with explicitly stated dependence on N, d, and γ. These bounds generalize the probabilistic bounds for Monte Carlo samples from [Heinrich et al., Acta Arith. 96 (2001), 279–302] and [C. Aistleitner, J. Complexity 27 (2011), 531–540], and they are optimal for Monte Carlo and Latin hypercube samples. In the special case of Monte Carlo samples the constants that appear in our bounds improve substantially on the constants presented in the latter paper and in [C. Aistleitner, M. T. Hofer, Math. Comp. 83 (2014), 1373–1381].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/24/2019

On Negatively Dependent Sampling Schemes, Variance Reduction, and Probabilistic Upper Discrepancy Bounds

We study some notions of negative dependence of a sampling scheme that c...
research
10/22/2020

Sharper convergence bounds of Monte Carlo Rademacher Averages through Self-Bounding functions

We derive sharper probabilistic concentration bounds for the Monte Carlo...
research
02/17/2020

Jittering Samples using a kd-Tree Stratification

Monte Carlo sampling techniques are used to estimate high-dimensional in...
research
01/22/2023

Bounds of star discrepancy for HSFC-based sampling

In this paper, we focus on estimating the probabilistic upper bounds of ...
research
05/05/2020

Statistical errors in Monte Carlo-based inference for random elements

Monte Carlo simulation is useful to compute or estimate expected functio...
research
03/15/2022

A novel sampler for Gauss-Hermite determinantal point processes with application to Monte Carlo integration

Determinantal points processes are a promising but relatively under-deve...
research
06/16/2020

MCRapper: Monte-Carlo Rademacher Averages for Poset Families and Approximate Pattern Mining

We present MCRapper, an algorithm for efficient computation of Monte-Car...

Please sign up or login with your details

Forgot password? Click here to reset