The inverse of the star-discrepancy depends linearly on the dimension
From MaRDI portal
Publication:4522902
DOI10.4064/AA96-3-7zbMATH Open0972.11065OpenAlexW2036753824MaRDI QIDQ4522902FDOQ4522902
Stefan Heinrich, H. Woźniakowski, Erich Novak, Grzegorz W. Wasilkowski
Publication date: 7 January 2001
Published in: Acta Arithmetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4064/aa96-3-7
Recommendations
- The supremum norm of the discrepancy function: recent results and connections
- Dichotomy results for the \(L^1\) norm of the discrepancy function
- On lower bounds for the \(L_2\)-discrepancy
- Irregularities of distributions and extremal sets in combinatorial complexity theory
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- Exact order of extreme \(L_p\) discrepancy of infinite sequences in arbitrary dimension
- Probabilistic discrepancy bound for Monte Carlo point sets
- DYADIC SHIFT RANDOMIZATION IN CLASSICAL DISCREPANCY THEORY
- Gaussian limits for discrepancies. I: Asymptotic results
- 1. On some recent developments in uniform distribution and discrepancy theory
Monte Carlo methods (65C05) Numerical quadrature and cubature formulas (65D32) Irregularities of distribution, discrepancy (11K38)
Cited In (71)
- The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers
- The minimal \(k\)-dispersion of point sets in high dimensions
- On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence
- Tractability properties of the discrepancy in Orlicz norms
- Tractability properties of the weighted star discrepancy
- On strong tractability of weighted multivariate integration
- Some Results on the Complexity of Numerical Integration
- Irregularities of Distributions and Extremal Sets in Combinatorial Complexity Theory
- Functions of bounded variation, signed measures, and a general Koksma–Hlawka inequality
- Quasi-Monte Carlo methods for high-dimensional integration: the standard (weighted Hilbert space) setting and beyond
- On a partition with a lower expected \(\mathcal{L}_2\)-discrepancy than classical jittered sampling
- Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples
- Tractability of quasilinear problems. I: General results
- On negative dependence properties of Latin hypercube samples and scrambled nets
- Asymptotic behavior of average \(L_p\)-discrepancies
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Intractability results for integration and discrepancy
- Calculation of Discrepancy Measures and Applications
- Covering numbers, dyadic chaining and discrepancy
- An algorithm to compute bounds for the star discrepancy
- Discrepancy Theory and Quasi-Monte Carlo Integration
- On tractability of weighted integration over bounded and unbounded regions in ℝ^{𝕤}
- On the tractability of multivariate integration and approximation by neural networks
- Secure pseudorandom bit generators and point sets with low star-discrepancy
- Discrepancy of stratified samples from partitions of the unit cube
- A lower bound for the dispersion on the torus
- A lower bound for the discrepancy of a random point set
- The randomized complexity of indefinite integration
- Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
- Probabilistic discrepancy bound for Monte Carlo point sets
- Some open problems concerning the star-discrepancy
- On the discrepancy of jittered sampling
- A note on the existence of sequences with small star discrepancy
- The VC-dimension of axis-parallel boxes on the torus
- The weighted star discrepancy of Korobov’s $p$-sets
- Improving a constant in high-dimensional discrepancy estimates
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Correction of a proof in “A probabilistic result on the discrepancy of a hybrid-Monte Carlo sequence and applications”
- An inequality for differences of distribution functions
- Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples
- Proof techniques in quasi-Monte Carlo theory
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- An elementary proof of a lower bound for the inverse of the star discrepancy
- Optimal jittered sampling for two points in the unit square
- A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
- A sharp discrepancy bound for jittered sampling
- Component-by-component construction of low-discrepancy point sets of small size
- Point sets on the sphere \(\mathbb{S}^{2}\) with small spherical cap discrepancy
- Bounds for the weighted \(L^p\) discrepancy and tractability of integration
- Minimizing the \(L_{2}\) and \(L_{\infty}\) star discrepancies of a single point in the unit hypercube
- The curse of dimensionality for the \(L_p\)-discrepancy with finite \(p\)
- Entropy, Randomization, Derandomization, and Discrepancy
- Open problems for tractability of multivariate integration.
- Digital inversive vectors can achieve polynomial tractability for the weighted star discrepancy and for multivariate integration
- An Upper Bound of the Minimal Dispersion via Delta Covers
- DYADIC SHIFT RANDOMIZATION IN CLASSICAL DISCREPANCY THEORY
- Tractability properties of the weighted star discrepancy of the Halton sequence
- Tractability properties of the weighted star discrepancy of regular grids
- Numerical integration of Hölder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series
- A nonlocal functional promoting low-discrepancy point sets
- Tractability results for the weighted star-discrepancy
- Introducing Quasirandomness to Computer Science
- On the information complexity for integration in subspaces of the Wiener algebra
- Probabilistic Star Discrepancy Bounds for Double Infinite Random Matrices
- Discrepancy Estimates For Acceptance-Rejection Samplers Using Stratified Inputs
- Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series
- The BMO-discrepancy suffers from the curse of dimensionality
- Tractability of sampling recovery on unweighted function classes
- Discrepancy of Digital Sequences: New Results on a Classical QMC Topic
This page was built for publication: The inverse of the star-discrepancy depends linearly on the dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522902)