A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
DOI10.1090/mcom/3666zbMath1485.11118arXiv2010.11479OpenAlexW3159303325MaRDI QIDQ4956929
Michael Gnewuch, Hendrik Pasing, Christian Weiß
Publication date: 2 September 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.11479
covering numberstar-discrepancysums of powerstractabilitynegative correlationbracketing numberFaulhaber's formulaweighted star-discrepancyMonte Carlo point setspre-asymptotic bound
Estimates on exponential sums (11L07) Inequalities for sums, series and integrals (26D15) Probabilistic theory: distribution modulo (1); metric theory of algorithms (11K99) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering numbers, dyadic chaining and discrepancy
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- A two-sided Faulhaber-like formula involving Bernoulli polynomials
- Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
- On the small ball inequality in all dimensions
- On the small ball inequality in three dimensions
- Multi-level Monte Carlo algorithms for infinite-dimensional integration on \(\mathbb R^{\mathbb N}\)
- Construction of minimal bracketing covers for rectangles
- When are quasi-Monte Carlo algorithms efficient for high dimensional integrals?
- An algorithm to compute bounds for the star discrepancy
- Randomized quasi-Monte Carlo: an introduction for practitioners
- Weak convergence and empirical processes. With applications to statistics
- On the inverse of the discrepancy for infinite dimensional infinite sequences
- Expected dispersion of uniformly distributed points
- Secure pseudorandom bit generators and point sets with low star-discrepancy
- Tractability results for the weighted star-discrepancy
- A lower bound for the discrepancy of a random point set
- An aspect of optimal regression design for LSMC
- A note on the existence of sequences with small star discrepancy
- Tractability properties of the weighted star discrepancy
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- Note on pairwise negative dependence of randomly shifted and jittered rank-1 lattices
- Probabilistic Star Discrepancy Bounds for Double Infinite Random Matrices
- Johann Faulhaber and Sums of Powers
- 3. On negatively dependent sampling schemes, variance reduction, and probabilistic upper discrepancy bounds
- Implementation of a Component-By-Component Algorithm to Generate Small Low-Discrepancy Samples
- Component-by-component construction of low-discrepancy point sets of small size
- Randomization of Number Theoretic Methods for Multiple Integration
- The inverse of the star-discrepancy depends linearly on the dimension
- Probabilistic Lower Bounds for the Discrepancy of Latin Hypercube Samples
- An Upper Bound of the Minimal Dispersion via Delta Covers
- Improving a constant in high-dimensional discrepancy estimates
- Negative Dependence, Scrambled Nets, and Variance Bounds
- Metrical Star Discrepancy Bounds for Lacunary Subsequences of Digital Kronecker-Sequences and Polynomial Tractability
- Optimal Randomized Multilevel Algorithms for Infinite-Dimensional Integration on Function Spaces with ANOVA-Type Decomposition
- Calculation of Discrepancy Measures and Applications
- Entropy, Randomization, Derandomization, and Discrepancy
- Probabilistic discrepancy bound for Monte Carlo point sets
- Irregularities of distribution, VII
This page was built for publication: A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
