Search

We study approximate integration of a function f over [0,1]^s based on taking the median of 2r-1 integral estimates derived from independently randomized (t,m,s)-nets in base 2. The nets are randomized by Matousek's random linear scramble with a random digital shift. If f is analytic over [0,1]^s, then the probability that any one randomized net's estimate has an error larger than 2^{-cm^2/s} times a quantity depending on f is O(1/\sqrt {m}) for any c<3\log (2)/\pi ^2\approx 0.21. As a result, the median of the distribution of these scrambled nets has an error that is O(n^{-c\log (n)/s}) for n=2^m function evaluations. The sample median of 2r-1 independent draws attains this rate too, so long as r/m^2 is bounded away from zero as m\to \infty. We include results for finite precision estimates and some nonasymptotic comparisons to taking the mean of 2r-1 independent draws. [ABSTRACT FROM AUTHOR]

Let f be analytic on [0,1] with |f^{(k)}(1/2)|\leqslant A\alpha ^kk! for some constants A and \alpha <2 and all k\geqslant 1. We show that the median estimate of \mu =\int _0^1f(x)\,\mathrm {d} x under random linear scrambling with n=2^m points converges at the rate O(n^{-c\log (n)}) for any c< 3\log (2)/\pi ^2\approx 0.21. We also get a super-polynomial convergence rate for the sample median of 2k-1 random linearly scrambled estimates, when k/m is bounded away from zero. When f has a p'th derivative that satisfies a \lambda-Hölder condition then the median of means has error O(n^{-(p+\lambda)+\epsilon }) for any \epsilon >0, if k\to \infty as m\to \infty. The proof techniques use methods from analytic combinatorics that have not previously been applied to quasi-Monte Carlo methods, most notably an asymptotic expression from Hardy and Ramanujan on the number of partitions of a natural number. [ABSTRACT FROM AUTHOR]

When a plain Monte Carlo estimate on n samples has variance σ 2 / n , then scrambled digital nets attain a variance that is o (1 / n) as n → ∞. For finite n and an adversarially selected integrand, the variance of a scrambled (t , m , s) -net can be at most Γ σ 2 / n for a maximal gain coefficient Γ < ∞. The most widely used digital nets and sequences are those of Sobol'. It was previously known that Γ ⩽ 2 t 3 s for any nets in base 2. For digital nets, Dick and Pillichshammer (2010) obtained the bound 2 t + s. In this paper we study digital nets in base 2 and show that Γ ⩽ 2 t + s − 1 for such nets. This bound is a simple, but apparently unnoticed, consequence of a microstructure analysis by Niederreiter and Pirsic in 2001. We obtain a sharper bound that is smaller than this for some digital nets. Our main finding is that all nonzero gain coefficients must be powers of two. A consequence of this latter fact is a simplified algorithm for computing gain coefficients of digital nets in base 2. [ABSTRACT FROM AUTHOR]