{"paper":{"title":"Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anselm Reichenbachs, Christoph Thaele, Kai Krokowski","submitted_at":"2015-03-03T17:54:59Z","abstract_excerpt":"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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.01029","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}