arXiv:1903.09319 [math.PR]AbstractReferencesReviewsResources
Stein's method via induction
Louis H. Y. Chen, Larry Goldstein, Adrian Röllin
Published 2019-03-22Version 1
Applying an inductive technique for Stein and zero bias couplings yields Berry-Esseen theorems for normal approximation with optimal rates in the Kolmogorov metric for two new examples. The conditions of the main results do not require that the couplings be bounded. Our two applications, one to the Erd\H{o}s-R\'enyi random graph with a fixed number of edges, and one to Jack measure on tableaux, demonstrate that the method can handle non-bounded variables with non-trivial global dependence.
Comments: 57 pages
Related articles: Most relevant | Search more
arXiv:2410.13152 [math.PR] (Published 2024-10-17)
Scaling limits of random graphs
arXiv:0908.3778 [math.PR] (Published 2009-08-26)
Extremal Subgraphs of Random Graphs: an Extended Version
arXiv:1207.6717 [math.PR] (Published 2012-07-28)
On the triangle space of a random graph