On the error bound in a combinatorial central limit theorem
Abstract
Let X=\Xij: 1 i,j n\ be an n× n array of independent random variables where n2. Let π be a uniform random permutation of \1,2,…,n\, independent of X, and let W=Σi=1nXiπ(i). Suppose X is standardized so that EW=0, Var(W)=1. We prove that the Kolmogorov distance between the distribution of W and the standard normal distribution is bounded by 451Σi,j=1nE|Xij|3/n. Our approach is by Stein's method of exchangeable pairs and the use of a concentration inequality.
0