相关论文: A multivariate central limit theorem for randomize…

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…

We prove central limit theorem for linear eigenvalue statistics of orthogonally invariant ensembles of random matrices with one interval limiting spectrum. We consider ensembles with real analytic potentials and test functions with two…

We consider the problem of estimating $\mathbb{E} [f(U^1, \ldots, U^d)]$, where $(U^1, \ldots, U^d)$ denotes a random vector with uniformly distributed marginals. In general, Latin hypercube sampling (LHS) is a powerful tool for solving…

Let $\mathbf{X}^{(1)}_{n},\ldots,\mathbf{X}^{(m)}_{n}$, where $\mathbf{X}^{(i)}_{n}=(X^{(i)}_{1},\ldots,X^{(i)}_{n})$, $i=1,\ldots,m$, be $m$ independent sequences of independent and identically distributed random variables taking their…

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

Let $(X_i,i\geq 1)$ be a sequence of i.i.d. random variables with values in $[0,1]$, and $f$ be a function such that $`E(f(X_1)^2)<+\infty$. We show a functional central limit theorem for the process $t\mapsto \sum_{i=1}^n f(X_i)1_{X_i\leq…

A functional central limit theorem is established for weighted occupancy processes of the Karlin model. The weighted occupancy processes take the form of, with $D_{n,j}$ denoting the number of urns with $j$-balls after the first $n$…

We take a unified approach to central limit theorems for a class of irreducible urn models with constant replacement matrix. Depending on the eigenvalue, we consider appropriate linear combinations of the number of balls of different…

Orthogonal array, a classical and effective tool for collecting data, has been flourished with its applications in modern computer experiments and engineering statistics. Driven by the wide use of computer experiments with both qualitative…

Ordered pivotal sampling is one of the simplest algorithm to perform without-replacement unequal probability sampling. It has found uses in the context of longitudinal surveys and spatial sampling, and enables in particular a good spatial…

Latin hypercube sampling (LHS) is a widely used stratified sampling method in computer experiments. In this work, we extend the existing convergence results for the sample mean under LHS to the broader class of $Z$-estimators, estimators…

A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…

The central limit theorem of martingales is the fundamental tool for studying the convergence of stochastic processes. The central limit theorem and functional central limit theorem are obtained for martingale like random variables under…

In computer experiments, it has become a standard practice to select the inputs that spread out as uniformly as possible over the design space. The resulting designs are called space-filling designs and they are undoubtedly desirable…

Monte Carlo experiments produce samples in order to estimate features of a given distribution. However, simultaneous estimation of means and quantiles has received little attention, despite being common practice. In this setting we…

We show how a central limit theorem for Poisson model random polygons implies a central limit theorem for uniform model random polygons. To prove this implication, it suffices to show that in the two models, the variables in question have…

Performing statistical analyses on collections of graphs is of import to many disciplines, but principled, scalable methods for multi-sample graph inference are few. Here we describe an "omnibus" embedding in which multiple graphs on the…

Suppose $X = (X_x, x$ in $Z^d)$ is a family of i.i.d. variables in some measurable space, $B_0$ is a bounded set in $R^d$, and for $t > 1$, $H_t$ is a measure on $tB_0$ determined by the restriction of $X$ to lattice sites in or adjacent to…

Central limit theorems are established for the sum, over a spatial region, of observations from a linear process on a $d$-dimensional lattice. This region need not be rectangular, but can be irregularly-shaped. Separate results are…

The generalized P\`olya urn (GPU) models and their variants have been investigated in several disciplines. However, typical assumptions made with respect to the GPU do not include urn models with diagonal replacement matrix, which arise in…