Normal approximation for generalizedU-statistics and weighted random graphs
From MaRDI portal
Publication:5086913
DOI10.1080/17442508.2021.1959583zbMath1503.60012arXiv2007.12811OpenAlexW3188925892MaRDI QIDQ5086913
Grzegorz Serafin, Nicolas Privault
Publication date: 8 July 2022
Published in: Stochastics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.12811
central limit theoremrandom graphnormal approximationStein-Chen methodsubgraph countMalliavin-Stein method
Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Stochastic calculus of variations and the Malliavin calculus (60H07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Berry-Esseen bounds and multivariate limit theorems for functionals of Rademacher sequences
- Fundamentals of Stein's method
- Stein's method and stochastic analysis of Rademacher functionals
- Stein's method on Wiener chaos
- Stein's method and normal approximation of Poisson functionals
- Séminaire de probabilités XXI. (Université de Strasbourg, Institut de Mathématiques)
- When are small subgraphs of a random graph normally distributed?
- A central limit theorem for decomposable random variables with applications to random graphs
- Stochastic variational calculus for the uniform density measure
- Stein approximation for functionals of independent random sequences
- Asymptotic distribution of quadratic forms
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
- Normal approximation for nonlinear statistics using a concentration inequality approach
- Wasserstein-2 bounds in normal approximation under local dependence
- Gamma limits and U-statistics on the Poisson space
- Random Graphs
This page was built for publication: Normal approximation for generalizedU-statistics and weighted random graphs