An improvement of a non-uniform bound for combinatorial central limit theorem

Abstract

ABSTRACTIn this article, we develop a new Rosenthal Inequality for uniform random permutation sums of random variables with finite third moments and apply it to obtain a sharp non-uniform bound for the combinatorial central limit theorem using the Stein's method and the exchangeable pair techniques. The obtained bound is shown to be sharper than other existing bounds.