Open Access
February 2015 On the error bound in a combinatorial central limit theorem
Louis H.Y. Chen, Xiao Fang
Bernoulli 21(1): 335-359 (February 2015). DOI: 10.3150/13-BEJ569

Abstract

Let $\mathbb{X}=\{X_{ij}\colon\ 1\le i,j\le n\}$ be an $n\times n$ array of independent random variables where $n\ge2$. Let $\pi$ be a uniform random permutation of $\{1,2,\dots,n\}$, independent of $\mathbb{X}$, and let $W=\sum_{i=1}^{n}X_{i\pi(i)}$. Suppose $\mathbb{X}$ is standardized so that $\mathbb{E}W=0$, $\operatorname{Var}(W)=1$. We prove that the Kolmogorov distance between the distribution of $W$ and the standard normal distribution is bounded by $451\sum_{i,j=1}^{n}\mathbb{E}|X_{ij}|^{3}/n$. Our approach is by Stein’s method of exchangeable pairs and the use of a concentration inequality.

Citation

Download Citation

Louis H.Y. Chen. Xiao Fang. "On the error bound in a combinatorial central limit theorem." Bernoulli 21 (1) 335 - 359, February 2015. https://doi.org/10.3150/13-BEJ569

Information

Published: February 2015
First available in Project Euclid: 17 March 2015

zbMATH: 1354.60011
MathSciNet: MR3322321
Digital Object Identifier: 10.3150/13-BEJ569

Keywords: combinatorial central limit theorem , concentration inequality , Exchangeable pairs , Stein’s method

Rights: Copyright © 2015 Bernoulli Society for Mathematical Statistics and Probability

Vol.21 • No. 1 • February 2015
Back to Top