相关论文: Star Discrepancy Bounds of Double Infinite Matrice…
By a result of Heinrich, Novak, Wasilkowski and Wo\'zniakowski the inverse of the star discrepancy $n(d,\varepsilon)$ satisfies $n(d,\varepsilon)\leq c_{\abs}d\varepsilon^{-2}$. Equivalently for any $N$ and $d$ there exists a set of $N$…
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…
By a profound result of Heinrich, Novak, Wasilkowski, and Wo{\'z}niakowski the inverse of the star-discrepancy $n^*(s,\ve)$ satisfies the upper bound $n^*(s,\ve) \leq c_{\mathrm{abs}} s \ve^{-2}$. This is equivalent to the fact that for any…
In 2004 the second author of the present paper proved that a point set in $[0,1]^d$ which has star-discrepancy at most $\varepsilon$ must necessarily consist of at least $c_{abs} d \varepsilon^{-1}$ points. Equivalently, every set of $n$…
The inverse of the star-discrepancy problem asks for point sets $P_{N,s}$ of size $N$ in the $s$-dimensional unit cube $[0,1]^s$ whose star-discrepancy $D^\ast(P_{N,s})$ satisfies $$D^\ast(P_{N,s}) \le C \sqrt{s/N},$$ where $C> 0$ is a…
The star discrepancy $D_N^*(\mathcal{P})$ is a quantitative measure for the irregularity of distribution of a finite point set $\mathcal{P}$ in the multi-dimensional unit cube which is intimately related to the integration error of…
We establish the existence of $N$-point sets in dimension $d$ whose star-discrepancy is bounded above by $2.4631832 \sqrt{\frac{d}{N}}$, where the numerical constant improves upon all previously known bounds. This improvement is obtained by…
The inverse of the star-discrepancy $N^*(d,\ve)$ denotes the smallest possible cardinality of a set of points in $[0,1]^d$ achieving a star-discrepancy of at most $\ve$. By a result of Heinrich, Novak, Wasilkowski and Wo{\'z}niakowski, $$…
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…
We investigate the expected star discrepancy under a newly designed class of convex equivolume partition models. The main contributions are two-fold. First, we establish a strong partition principle for the star discrepancy, showing that…
In the present paper we prove several results concerning the existence of low-discrepancy point sets with respect to an arbitrary non-uniform measure $\mu$ on the $d$-dimensional unit cube. We improve a theorem of Beck, by showing that for…
The star-discrepancy is a quantitative measure for the irregularity of distribution of a point set in the unit cube that is intimately linked to the integration error of quasi-Monte Carlo algorithms. These popular integration rules are…
It is known that there is a constant $c>0$ such that for every sequence $x_1, x_2,\ldots$ in $[0,1)$ we have for the star discrepancy $D^{*}_N$ of the first $N$ elements of the sequence that $N D^{*}_N\geq c\cdot \log N$ holds for…
The inverse of the star discrepancy, $N(\epsilon, s)$, defined as the minimum number of points required to achieve a star discrepancy of at most $\epsilon$ in dimension $s$, is known to depend linearly on $s$. However, explicit…
The $L_{\infty}$ star discrepancy is a very well-studied measure used to quantify the uniformity of a point set distribution. Constructing optimal point sets for this measure is seen as a very hard problem in the discrepancy community.…
The star discrepancy is a quantitative measure of the uniformity of a point set in the unit cube. A central quantity of interest is the inverse of the star discrepancy, $N(\varepsilon, s)$, defined as the minimum number of points required…
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,…
We consider the star discrepancy of two-dimensional sequences made up as a hybrid between a Kronecker sequence and a perturbed Halton sequence in base 2, where the perturbation is achieved by a digital-sequence construction in the sense of…
It is known that there is a constant $c > 0$ such that for every sequence $x_1, x_2, \ldots$ in $[0,1)$ we have for the star discrepancy $D_N^*$ of the first $N$ elements of the sequence that $N D_N^* \ge c \cdot \log N$ holds for…
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…