The mean square discrepancy of randomized nets
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Latin supercube sampling for very high-dimensional simulations
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Monto Carlo extension of quasi-Monte Carlo
Proceedings of the 30th conference on Winter simulation
Quasi-Monte Carlo via linear shift-register sequences
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
Exploring quasi Monte Carlo for marginal density approximation
Statistics and Computing
Time Series Simulation with Quasi Monte Carlo Methods
Computational Economics
The discrepancy and gain coefficients of scrambled digital nets
Journal of Complexity
On the Use of Quasi-Monte Carlo Methods in Computational Finance
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Integration of Multivariate Haar Wavelet Series
WAA '01 Proceedings of the Second International Conference on Wavelet Analysis and Its Applications
Discrepancy Theory and Its Application to Finance
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Asymptotic properties of the spectral test, diaphony, and related quantities
Mathematics of Computation
Algorithm 823: Implementing scrambled digital sequences
ACM Transactions on Mathematical Software (TOMS)
Journal of Complexity
Variance with alternative scramblings of digital nets
ACM Transactions on Modeling and Computer Simulation (TOMACS)
I-binomial scrambling of digital nets and sequences
Journal of Complexity
Optimal quadrature for Haar wavelet spaces
Mathematics of Computation
On the root mean square weighted L2 discrepancy of scrambled nets
Journal of Complexity
On the xorshift random number generators
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the necessity of low-effective dimension
Journal of Complexity
Some large deviations results for Latin hypercube sampling
WSC '05 Proceedings of the 37th conference on Winter simulation
Journal of Complexity
Exact cubature for a class of functions of maximum effective dimension
Journal of Complexity - Special issue: Information-based complexity workshops FoCM conference Santander, Spain, July 2005
Hybrid method for the chemical master equation
Journal of Computational Physics
Cubature formulas for function spaces with moderate smoothness
Journal of Complexity
Applied Numerical Mathematics
A practical view of randomized quasi-Monte Carlo: invited presentation, extended abstract
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
On the necessity of low-effective dimension
Journal of Complexity
Dispersion-based population initialization
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Parameterization based on randomized quasi-Monte Carlo methods
Parallel Computing
Multi-level Monte Carlo algorithms for infinite-dimensional integration on RN
Journal of Complexity
Exact sampling with highly uniform point sets
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Constructions of (t ,m,s)-nets and (t,s)-sequences
Finite Fields and Their Applications
Hi-index | 0.01 |
Hybrids of equidistribution and Monte Carlo methods of integration can achieve the superior accuracy of the former while allowing the simple error estimation methods of the latter. This paper studies the variance of one such hybrid, scrambled nets, by applying a multidimensional multiresolution (wavelet) analysis to the integrand. The integrand is assumed to be measurable and square integrable but not necessarily of bounded variation. In simple Monte Carlo, every nonconstant term of the multiresolution contributes to the variance of the estimated integral. For scrambled nets, certain low-dimensional and coarse terms do not contribute to the variance. For any integrand in L2, the sampling variance tends to zero faster under scrambled net quadrature than under Monte Carlo sampling, as the number of function evaluations n tends to infinity. Some finite n results bound the variance under scrambled net quadrature by a small constant multiple of the Monte Carlo variance, uniformly over all integrands f. Latin hypercube sampling is a special case of scrambled net quadrature.