Berry-Esseen bounds for generalized \(U\)-statistics
From MaRDI portal
Publication:2084842
DOI10.1214/22-EJP860MaRDI QIDQ2084842
Publication date: 13 October 2022
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.03479
Stein's methodBerry-Esseen boundErdős-Rényi modelgeneralized U-statisticsexchangeable pair approachgraphon-generated random graph
Related Items (2)
Fluctuations of subgraph counts in graphon based random graphs ⋮ From \(p\)-Wasserstein bounds to moderate deviations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative de Jong theorems in any dimension
- Identifying the limiting distribution by a general approach of Stein's method
- Nonnormal approximation by Stein's method of exchangeable pairs with application to the Curie-Weiss model
- Cramér type moderate deviation theorems for self-normalized processes
- The asymptotic distributions of generalized U-statistics with applications to random graphs
- Limits of dense graph sequences
- Asymptotic normality of graph statistics
- On the statistics of vision: The Julesz conjecture
- A central limit theorem for decomposable random variables with applications to random graphs
- On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted \(U\)-statistics
- New Berry-Esseen bounds for functionals of binomial point processes
- Berry-Esseen bounds of normal and nonnormal approximation for unbounded exchangeable pairs
- Higher-order fluctuations in dense random graph models
- Percolation on dense graph sequences
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Stein's method for concentration inequalities
- Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
- Normal approximation for nonlinear statistics using a concentration inequality approach
- Normal Approximation by Stein’s Method
- KOLMOGOROV BOUNDS FOR THE NORMAL APPROXIMATION OF THE NUMBER OF TRIANGLES IN THE ERDŐS–RÉNYI RANDOM GRAPH
- The phase transition in inhomogeneous random graphs
- A Class of Statistics with Asymptotically Normal Distribution
- The cut metric, random graphs, and branching processes
This page was built for publication: Berry-Esseen bounds for generalized \(U\)-statistics
