arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.01029math.PRmath.CO
收藏

Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation

Kai Krokowski, Anselm Reichenbachs, Christoph Thaele

英文摘要:

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ős-Renyi random graph. A further application deals with a percolation problem on trees.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑