Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
DOI10.1214/15-AOP1081zbMath1372.05203arXiv1503.01029MaRDI QIDQ2412666
Christoph Thäle, Kai Krokowski, Anselm Reichenbachs
Publication date: 24 October 2017
Published in: The Annals of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.01029
treepercolationcentral limit theoremrandom graphBerry-Esseen boundMehler's formulaRademacher functionalMalliavin-Stein methodsub-graph count
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Percolation (82B43) Stochastic calculus of variations and the Malliavin calculus (60H07) Vertex degrees (05C07)
Related Items (17)
This page was built for publication: Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation