Component-by-component construction of low-discrepancy point sets of small size
From MaRDI portal
Publication:3516786
DOI10.1515/MCMA.2008.007zbMath1156.11030OpenAlexW2073688703MaRDI QIDQ3516786
Benjamin Doerr, Peter Kritzer, Michael Gnewuch, Friedrich Pillichshammer
Publication date: 11 August 2008
Published in: Monte Carlo Methods and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/mcma.2008.007
Related Items (12)
Probabilistic Star Discrepancy Bounds for Double Infinite Random Matrices ⋮ Entropy, Randomization, Derandomization, and Discrepancy ⋮ The Inverse of the Star-Discrepancy Problem and the Generation of Pseudo-Random Numbers ⋮ Some Results on the Complexity of Numerical Integration ⋮ Probabilistic discrepancy bound for Monte Carlo point sets ⋮ Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples ⋮ Algorithmic construction of low-discrepancy point sets via dependent randomized rounding ⋮ On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence ⋮ A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy ⋮ Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems ⋮ Discrepancy Theory and Quasi-Monte Carlo Integration ⋮ Calculation of Discrepancy Measures and Applications
Cites Work
- Point sets and sequences with small discrepancy
- Funktionen von beschränkter Variation in der Theorie der Gleichverteilung
- Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- An algorithm to compute bounds for the star discrepancy
- Some open problems concerning the star-discrepancy
- A note on the existence of sequences with small star discrepancy
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Improved upper bounds on the star discrepancy of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- Dependent rounding and its applications to approximation algorithms
- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- The inverse of the star-discrepancy depends linearly on the dimension
- Probability Inequalities for Sums of Bounded Random Variables
- Generating Randomized Roundings with Cardinality Constraints and Derandomizations
This page was built for publication: Component-by-component construction of low-discrepancy point sets of small size
