A Uniform Bound on a Combinatorial Central Limit Theorem for Randomized Orthogonal Array Sampling Designs

DOI10.1080/07362990701857012zbMath1151.62017OpenAlexW1999812654MaRDI QIDQ5459754

K. Laipaporn, K. Neammanee

Publication date: 29 April 2008

Published in: Stochastic Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/07362990701857012

zbMATH Keywords

Stein's methodorthogonal arrayscomputer experimentsrandom permutations

Mathematics Subject Classification ID

Asymptotic distribution theory in statistics (62E20) Design of statistical experiments (62K99) Central limit and other weak theorems (60F05) Sampling theory, sample surveys (62D05) Transversal (matching) theory (05D15)

Related Items

An Improvement of a Uniform Bound on a Combinatorial Central Limit Theorem ⋮ An Improvement of a Non Uniform Bound on Normal Approximation of Randomized Orthogonal Array Sampling Designs ⋮ Bounds on Normal Approximations for the number of Descents and Inversions ⋮ A nonuniform bound to an independent test in high dimensional data analysis via Stein's method ⋮ An Improvement of Normal Approximation of Randomized Orthogonal Array Sampling Designs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Latin hypercube sampling
• Scrambled net variance for integrals of smooth functions
• 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
• Monte Carlo Variance of Scrambled Net Quadrature