pith. sign in

arxiv: 0708.0656 · v1 · submitted 2007-08-05 · 🧮 math.ST · stat.ME· stat.TH

A multivariate central limit theorem for randomized orthogonal array sampling designs in computer experiments

classification 🧮 math.ST stat.MEstat.TH
keywords orthogonalrandomizedarraycentralchoiceclasscomputerdesigns
0
0 comments X
read the original abstract

Let $f:[0,1)^d \to {\mathbb R}$ be an integrable function. An objective of many computer experiments is to estimate $\int_{[0,1)^d} f(x) dx$ by evaluating f at a finite number of points in [0,1)^d. There is a design issue in the choice of these points and a popular choice is via the use of randomized orthogonal arrays. This article proves a multivariate central limit theorem for a class of randomized orthogonal array sampling designs [Owen (1992a)] as well as for a class of OA-based Latin hypercubes [Tang (1993)].

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.