Can I read Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation on EtoBox?

Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation by Krokowski, Kai; Reichenbachs, Anselm; Thaele, Christoph is a scholarly article available to read on EtoBox.

What is Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation about?

A new Berry-Esseen bound for non-linear functionals of non-symmetric and non-homogeneous 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\H{o}s-Renyi random graph. A further application deals with a percolation problem on trees.

Author

Krokowski, Kai; Reichenbachs, Anselm; Thaele, Christoph

Published

2015

Language

EN