Normal approximation for generalized U-statistics and weighted random graphs
From MaRDI portal
(Redirected from Publication:5086913)
Normal approximation for generalized \(U\)-statistics and weighted random graphs
Normal approximation for generalized \(U\)-statistics and weighted random graphs
Abstract: We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to normal approximation for the combined weights of subgraphs in the ErdH{o}s-R'enyi random graph, extending the graph counting results of [1] to the setting of graph weighting. Our approach relies on a general stochastic analytic framework for functionals of independent random sequences.
Recommendations
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Wasserstein-2 bounds in normal approximation under local dependence
- Berry-Esseen bounds for generalized U-statistics
- Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
- scientific article; zbMATH DE number 7662451
Cites work
- A central limit theorem for decomposable random variables with applications to random graphs
- Asymptotic distribution of quadratic forms
- Berry-Esseen bounds and multivariate limit theorems for functionals of Rademacher sequences
- Discrete Malliavin-Stein method: Berry-Esseen bounds for random graphs and percolation
- Fundamentals of Stein's method
- Gamma limits and U-statistics on the Poisson space
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 1944308 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- Normal approximation for nonlinear statistics using a concentration inequality approach
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Random Graphs
- Stein approximation for functionals of independent random sequences
- Stein's method and normal approximation of Poisson functionals
- Stein's method and stochastic analysis of Rademacher functionals
- Stein's method on Wiener chaos
- Stochastic variational calculus for the uniform density measure
- Séminaire de probabilités XXI. (Université de Strasbourg, Institut de Mathématiques)
- The Stein and Chen-Stein methods for functionals of non-symmetric Bernoulli processes
- Wasserstein-2 bounds in normal approximation under local dependence
- When are small subgraphs of a random graph normally distributed?
Cited in
(10)- Asymptotic normality of graph statistics
- Weighted dependency graphs
- Berry-Esseen bounds for functionals of independent random variables
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Wasserstein-2 bounds in normal approximation under local dependence
- Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
- Asymptotic normality of some Graph-Related statistics
- Normal approximation for statistics of randomly weighted complexes
- Normal approximation for subgraph count in random hypergraphs
- The asymptotic distributions of generalized U-statistics with applications to random graphs
This page was built for publication: Normal approximation for generalized \(U\)-statistics and weighted random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086913)
