A combinatorial central limit theorem for randomized orthogonal array sampling designs

DOI10.1214/aos/1032526964zbMath0869.62018OpenAlexW2010678753MaRDI QIDQ1816980

Wei-Liem Loh

Publication date: 11 September 1997

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1032526964

zbMATH Keywords

asymptotic normalityStein's methoderror boundconvergence ratecombinatorial central limit theoremrandomized orthogonal arrays

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Design of statistical experiments (62K99) Central limit and other weak theorems (60F05) Statistical block designs (62K10)

Related Items

On the Instability Issue of Gradient-Enhanced Gaussian Process Emulators for Computer Experiments ⋮ An Improvement of a Non Uniform Bound on Normal Approximation of Randomized Orthogonal Array Sampling Designs ⋮ Accurate emulators for large-scale computer experiments ⋮ On the asymptotic distribution of scrambled net quadrature. ⋮ A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments ⋮ Randomized quasi-Monte Carlo methods in pricing securities ⋮ Parameterization based on randomized quasi-Monte Carlo methods ⋮ A randomized orthogonal array-based procedure for the estimation of first- and second-order Sobol' indices ⋮ Construction of nested space-filling designs

Cites Work

• An \(L_p\) bound for the remainder in a combinatorial central limit theorem
• Lattice sampling revisited: Monte Carlo variance of means over randomized orthogonal arrays
• A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
• Large Sample Properties of Simulations Using Latin Hypercube Sampling
• Orthogonal Array-Based Latin Hypercubes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item