Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
From MaRDI portal
Publication:3578671
Abstract: In a recent paper by the authors, a new approach--called the "embedding method"--was introduced, which allows to make use of exchangeable pairs for normal and multivariate normal approximation with Stein's method in cases where the corresponding couplings do not satisfy a certain linearity condition. The key idea is to embed the problem into a higher dimensional space in such a way that the linearity condition is then satisfied. Here we apply the embedding to U-statistics as well as to subgraph counts in random graphs.
Recommendations
- Subgraph counts in random graphs using incomplete U-statistics methods
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Normal approximation for generalized \(U\)-statistics and weighted random graphs
- A functional limit theorem for random graphs with applications to subgraph count statistics
- The asymptotic distributions of generalized U-statistics with applications to random graphs
- scientific article; zbMATH DE number 22562
- Concentration for Poisson \(U\)-statistics: subgraph counts in random geometric graphs
- Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics
Cites work
- A generalization of the Lindeberg principle
- A multivariate CLT for decomposable random vectors with finite second moments
- A multivariate CLT for local dependence with \(n^{-1/2}\log n\) rate and applications to multivariate graph related statistics
- Exact convergence rates in some martingale central limit theorems
- scientific article; zbMATH DE number 47948 (Why is no real title available?)
- scientific article; zbMATH DE number 50805 (Why is no real title available?)
- scientific article; zbMATH DE number 3438144 (Why is no real title available?)
- Multivariate normal approximation using exchangeable pairs
- Multivariate normal approximation with Stein's method of exchangeable pairs under a general linearity condition
- On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted U-statistics
- On Stein's method for multivariate normal approximation
- Some Bounds on the Rate of Convergence in the CLT for Martingales. I
- Stein's method and stochastic analysis of Rademacher functionals
- Susceptibility in subcritical random graphs
- The asymptotic distributions of generalized U-statistics with applications to random graphs
- The rate of convergence for multivariate sampling statistics
Cited in
(23)- Quantitative CLTs for symmetric U-statistics using contractions
- Functional approximations via Stein's method of exchangeable pairs
- Stein's method of exchangeable pairs in multivariate functional approximations
- Fixed point characterizations of continuous univariate probability distributions and their applications
- Higher-order fluctuations in dense random graph models
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
- Non uniform exponential bounds on normal approximation by Stein's method and monotone size bias couplings
- Multivariate normal approximations by Stein's method and size bias couplings
- Normal approximation for generalized \(U\)-statistics and weighted random graphs
- Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
- U-Statistics on bipartite exchangeable networks
- Vector-valued statistics of binomial processes: Berry-Esseen bounds in the convex distance
- Multivariate central limit theorems for random clique complexes
- Limit laws for the generalized Zagreb indices of random graphs
- Moderate deviations of triangle counts in the Erdős-Rényi random graph G (n, m): the lower tail
- Degree of balance in random signed graphs
- Hoeffding-type decomposition for U-statistics on bipartite networks
- Testing for the network small-world property
- Moderate deviations of triangle counts in sparse Erdős-Rényi random graphs G(n, m) and G(n, p)
- Moderate deviations of triangle counts -- the lower tail (extended abstract)
- Characterization of the asymptotic behaviour of U-statistics on row-column exchangeable matrices
- Rates of convergence for multivariate normal approximation with applications to dense graphs and doubly indexed permutation statistics
- Multivariate normal approximation with Stein's method of exchangeable pairs under a general linearity condition
This page was built for publication: Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3578671)
