58
35

On the Error Bound in a Combinatorial Central Limit Theorem

Abstract

Let X=Xij:1i,jn\mathbb{X}={X_{ij}: 1\le i,j \le n} be an n×nn\times n array of independent random variables where n2n \ge 2. Let π\pi be a uniform random permutation of 1,2,...,n{1,2,..., n}, independent of X\mathbb{X}, and let W=i=1nXiπ(i)W=\sum_{i=1}^n X_{i\pi(i)}. Suppose X\mathbb{X} is standardized so that \EW=0,\Var(W)=1\E W=0, \Var(W)=1. We prove that the Kolmogorov distance between the distribution of WW and the standard normal distribution is bounded by 451i,j=1n\EXij3/n451\sum_{i,j=1}^n \E |X_{ij}|^3/n. Our approach is by Stein's method of exchangeable pairs and the use of a concentration inequality.

View on arXiv
Comments on this paper