A Berry-Esseen bound with applications to vertex degree counts in the Erdős-Rényi random graph (Q1948698): Difference between revisions

A Berry-Esseen bound is given for sums of dependent random variables. The proof is based on applying the inductive size bias version of Stein's method without assuming the coupling to be bounded [\textit{L. H. Y. Chen, L. Goldstein} and \textit{Q.-M. Shao}, Normal approximation by Stein's method. Berlin: Springer (2011; Zbl 1213.62027)]. The main result is then applied to obtain bounds for the number of vertices in Erdős-Rényi random graphs. For further applications, see [\textit{J. Bartroff} and \textit{L. Goldstein}, Electron. J. Probab. 18, Paper No. 27, 29 p. (2013; Zbl 1287.60031)].