English
Related papers

Related papers: Probabilistic Star Discrepancy Bounds for Lacunary…

200 papers

Following a result of D.~Bylik and M.T.~Lacey from 2008 it is known that there exists an absolute constant $\eta>0$ such that the (unnormalized) $L^{\infty}$-norm of the three-dimensional discrepancy function, i.e, the (unnormalized) star…

Number Theory · Mathematics 2020-09-15 Florian Puchhammer

According to Aistleitner and Weimar, there exist two-dimensional (double) infinite matrices whose star-discrepancy $D_N^{*s}$ of the first $N$ rows and $s$ columns, interpreted as $N$ points in $[0,1]^s$, satisfies an inequality of the form…

Number Theory · Mathematics 2026-01-13 Jasmin Fiedler , Michael Gnewuch , Christian Weiß

We establish sharp non-asymptotic probabilistic bounds for the star discrepancy of double-infinite random matrices -- a canonical model for sequences of random point sets in high dimensions. By integrating the recently proved…

Statistics Theory · Mathematics 2026-01-09 Xiaoda Xu , Jun Xian

Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combinatorial discrepancy. Depending on the ranges, several…

Computational Geometry · Computer Science 2011-03-24 Panos Giannopoulos , Christian Knauer , Magnus Wahlström , Daniel Werner

We present a new algorithm for estimating the star discrepancy of arbitrary point sets. Similar to the algorithm for discrepancy approximation of Winker and Fang [SIAM J. Numer. Anal. 34 (1997), 2028--2042] it is based on the optimization…

Data Structures and Algorithms · Computer Science 2021-09-21 Michael Gnewuch , Magnus Wahlström , Carola Winzen

The $L_{\infty}$ star discrepancy is a measure for the regularity of a finite set of points taken from $[0,1)^d$. Low discrepancy point sets are highly relevant for Quasi-Monte Carlo methods in numerical integration and several other…

Neural and Evolutionary Computing · Computer Science 2023-06-30 François Clément , Diederick Vermetten , Jacob de Nobel , Alexandre D. Jesus , Luís Paquete , Carola Doerr

We provide probabilistic lower bounds for the star discrepancy of Latin hypercube samples. These bounds are sharp in the sense that they match the recent probabilistic upper bounds for the star discrepancy of Latin hypercube samples proved…

Numerical Analysis · Mathematics 2021-09-21 Benjamin Doerr , Carola Doerr , Michael Gnewuch

We present two main contributions to the expected star discrepancy theory. First, we derive a sharper expected upper bound for jittered sampling, improving the leading constants and logarithmic terms compared to the state-of-the-art [Doerr,…

Statistics Theory · Mathematics 2026-01-09 Xiaoda Xu , Jun Xian

It is well-known that for every $N \geq 1$ and $d \geq 1$ there exist point sets $x_1, \dots, x_N \in [0,1]^d$ whose discrepancy with respect to the Lebesgue measure is of order at most $(\log N)^{d-1} N^{-1}$. In a more general setting,…

Combinatorics · Mathematics 2017-03-20 Christoph Aistleitner , Dmitriy Bilyk , Aleksandar Nikolov

We prove a generalized Faulhaber inequality to bound the sums of the $j$-th powers of the first $n$ (possibly shifted) natural numbers. With the help of this inequality we are able to improve the known bounds for bracketing numbers of…

Combinatorics · Mathematics 2022-02-11 Michael Gnewuch , Hendrik Pasing , Christian Weiß

We provide an algorithm to approximate a finitely supported discrete measure $\mu$ by a measure $\nu_{N}$ corresponding to a set of $N$ points so that the total variation between $\mu$ and $\nu_N$ has an upper bound. As a consequence if…

Number Theory · Mathematics 2022-07-11 Samantha Fairchild , Max Goering , Christian Weiß

We introduce a class of convex equivolume partitions. Expected star discrepancy results are compared for stratified samples under these partitions, including simple random samples. There are four main parts of our results. First, among…

Statistics Theory · Mathematics 2022-03-08 Jun Xian , Xiaoda Xu , Xinkai Zhou

We improve the best known upper bound for the bracketing number of $d$-dimensional axis-parallel boxes anchored in $0$ (or, put differently, of lower left orthants intersected with the $d$-dimensional unit cube $[0,1]^d$). More precisely,…

Combinatorics · Mathematics 2024-09-20 Michael Gnewuch

Let $(n_k)_{k=1}^{\infty}$ be a lacunary sequence of integers. We show that if $\mu$ is a probability measure on $[0,1)$ such that $|\widehat{\mu}(t)|\leq c|t|^{-\eta}$, then for $\mu$-almost all $x$, the discrepancy $D_N(n_kx)$ satisfies…

Number Theory · Mathematics 2019-06-06 Niclas Technau , Agamemnon Zafeiropoulos

We consider the problem of finding, for a given quadratic measure of non-uniformity of a set of $N$ points (such as $L_2$ star-discrepancy or diaphony), the asymptotic distribution of this discrepancy for truly random points in the limit…

Computational Physics · Physics 2009-10-30 Andre van Hameren , Ronald Kleiss , Jiri Hoogland

We start by providing a very simple and elementary new proof of the classical bound due to J. Beck which states that the spherical cap $\mathbb{L}_2$-discrepancy of any $N$ points on the unit sphere $\mathbb S^d$ in $\mathbb{R}^{d+1}$,…

Classical Analysis and ODEs · Mathematics 2025-02-25 Dmitriy Bilyk , Johann S. Brauchart

The ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo and Willsky considers the maximum number $n$ random Gaussian points in $\mathbb{R}^d$, such that with high probability, there exists an origin-symmetric ellipsoid…

Probability · Mathematics 2023-07-25 Madhur Tulsiani , June Wu

For $\varepsilon\in(0,1/2)$ and a natural number $d\ge 2$, let $N$ be a natural number with \[ N \,\ge\, 2^9\,\log_2(d)\, \left(\frac{\log_2(1/\varepsilon)}{\varepsilon}\right)^2. \] We prove that there is a set of $N$ points in the unit…

Classical Analysis and ODEs · Mathematics 2019-08-15 Mario Ullrich , Jan Vybíral

It is shown that \begin{equation*} \mathsf{P}(\|a_1U_1+\dots+a_nU_n\|>u)\le c\,\mathsf{P}(a\|Z_d\|>u) \end{equation*} for all real $u$, where $U_1,\dots,U_n$ are independent random vectors uniformly distributed on the unit sphere in…

Probability · Mathematics 2017-01-17 Iosif Pinelis

We show that the isotropic discrepancy of a lattice point set can be bounded from below and from above in terms of the spectral test of the corresponding integration lattice. From this we deduce that the isotropic discrepancy of any…

Number Theory · Mathematics 2022-09-16 Friedrich Pillichshammer , Mathias Sonnleitner