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

DOI10.1080/07362990701857012MaRDI QIDQ5459754zbMATH OpenOpenAlexFDO

Authors K. Neammanee, K. Laipaporn

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

computer experimentsStein's methodorthogonal arraysrandom permutations

Mathematics Subject Classification ID

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

Recommendations

• A combinatorial central limit theorem for randomized orthogonal array sampling designs
• A non-uniform concentration inequality for randomized orthogonal array sampling designs
• A non-uniform bound on normal approximation of randomized orthogonal array sampling designs
• An improvement of a non uniform bound on normal approximation of randomized orthogonal array sampling designs
• An improvement of a non-uniform concentration inequality for randomized orthogonal array sampling designs
• A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments
• A central limit theorem for general orthogonal array based space-filling designs
• A uniform bound on the generalization of a combinatorial central limit theorem
• A Uniform Bound on a Combinatorial Central Limit Theorem

Cites work

• scientific article; zbMATH DE number 3854294 (Why is no real title available?)
• scientific article; zbMATH DE number 50805 (Why is no real title available?)
• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• scientific article; zbMATH DE number 1438352 (Why is no real title available?)
• scientific article; zbMATH DE number 3352656 (Why is no real title available?)
• 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
• Monte Carlo Variance of Scrambled Net Quadrature
• On Latin hypercube sampling
• Orthogonal Array-Based Latin Hypercubes
• Scrambled net variance for integrals of smooth functions

Cited in

(9)

• A non-uniform concentration inequality for randomized orthogonal array sampling designs
• A non-uniform bound on normal approximation of randomized orthogonal array sampling designs
• A nonuniform bound to an independent test in high dimensional data analysis via Stein's method
• An improvement of a uniform bound on a combinatorial central limit theorem
• A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments
• An improvement of a non-uniform concentration inequality for randomized orthogonal array sampling designs
• An Improvement of Normal Approximation of Randomized Orthogonal Array Sampling Designs
• Bounds on normal approximations for the number of descents and inversions
• An improvement of a non uniform bound on normal approximation of randomized orthogonal array sampling designs

This page was built for publication: A Uniform Bound on a Combinatorial Central Limit Theorem for Randomized Orthogonal Array Sampling Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459754)