Abstract
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–Renyi random graph. A further application deals with a percolation problem on trees.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
