A new Berry–Esseen bound for nonlinear functionals of nonsymmetric and nonhomogeneous infinite Rademacher sequences is established. It is based on a discrete version of the Malliavin–Stein method and an analysis of the discrete Ornstein–Uhlenbeck semigroup. The result is applied to sub-graph counts and to the number of vertices having a prescribed degree in the Erdős–Rényi random graph. A further application deals with a percolation problem on trees.
No takes yet. Share an insight, caveat, or question.
Krokowski et al. (2017) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: