On the Error Bound in a Combinatorial Central Limit Theorem

Abstract
Let be an array of independent random variables where . Let be a uniform random permutation of , independent of , and let . Suppose is standardized so that . We prove that the Kolmogorov distance between the distribution of and the standard normal distribution is bounded by . Our approach is by Stein's method of exchangeable pairs and the use of a concentration inequality.
View on arXivComments on this paper