A central limit theorem for general orthogonal array based space-filling designs
一般正交阵列空间填充设计的中心极限定理
Orthogonal array based space-filling designs (Owen [Statist. Sinica 2 (1992a) 439–452]; Tang [J. Amer. Statist. Assoc. 88 (1993) 1392–1397]) have become popular in computer experiments, numerical integration, stochastic optimization and uncertainty quantification. As improvements of ordinary Latin hypercube designs, these designs achieve stratification in multi-dimensions. If the underlying orthogonal array has strength $t$, such designs achieve uniformity up to $t$ dimension…