Subgraph counts in random graphs using incomplete U-statistics methods
From MaRDI portal
In this paper the authors have established that the subgraph count random variable \(S_ n(G)\) has an asymptotic normal distribution for all graphs G with no isolated vertices and for a wide range of values of p including any constant p and sequences of p(n) tending to 0 or 1 sufficiently slowly. This result fills a substantial gap in the literature on asymptotic subgraph count distribuions. The authors have introduced statistical tools for treating sums of dependent random variables, from the theory of U-statistics and have adapted them skillfully for treatment of subgraph counts. They have considered counts of intersections of isomorphic subgraphs for computation of variances of the relevant statistics.
Recommendations
- Asymptotic distributions in random graphs with applications to social networks
- scientific article; zbMATH DE number 17683
- When are small subgraphs of a random graph normally distributed?
- scientific article; zbMATH DE number 3943865
- A functional limit theorem for random graphs with applications to subgraph count statistics
Cites work
- A Class of Statistics with Asymptotically Normal Distribution
- Asymptotic normality of permutation statistics derived from weighted sums of bivariate functions
- Convergence rates for U-statistics and related statistics
- Edgeworth expansions in nonparametric statistics
- scientific article; zbMATH DE number 3889584 (Why is no real title available?)
- scientific article; zbMATH DE number 3168330 (Why is no real title available?)
- scientific article; zbMATH DE number 3865331 (Why is no real title available?)
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 3904630 (Why is no real title available?)
- scientific article; zbMATH DE number 3965172 (Why is no real title available?)
- scientific article; zbMATH DE number 4041966 (Why is no real title available?)
- scientific article; zbMATH DE number 3334700 (Why is no real title available?)
- Limiting Behavior of Posterior Distributions when the Model is Incorrect
- On the Berry-Esseen theorem for U-statistics
- Reduced U-statistics and the Hodges-Lehmann estimator
- The Berry-Esseen theorem for U-statistics
- Threshold functions for small subgraphs
- When are small subgraphs of a random graph normally distributed?
Cited in
(46)- When are small subgraphs of a random graph normally distributed?
- Asymptotic normality of graph statistics
- 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
- On the number of subgraphs of a specified form embedded in a random graph
- Minimum variance rectangular designs for U-statistics.
- Small variance of subgraph counts in a random tournament
- Upper tails for subgraph counts in random graphs
- Anti-concentration for subgraph counts in random graphs
- Edgeworth expansions for network moments
- Motif-based tests for bipartite networks
- Logarithmic Sobolev inequalities for finite spin systems and applications
- On the number of weakly connected subdigraphs in random \(k\)NN digraphs
- Modular statistics for subgraph counts in sparse random graphs
- Normal approximation for sums of weighted \(U\)-statistics -- application to Kolmogorov bounds in random subgraph counting
- Poisson approximation of subgraph counts in stochastic block models and a graphon model
- scientific article; zbMATH DE number 2127720 (Why is no real title available?)
- Moderate deviations of subgraph counts in the Erdős-Rényi random graphs \(G(n,m)\) and \(G(n,p)\)
- Asymptotic analysis for the number of subgraphs of a given size in temporal random graphs.
- A functional limit theorem for random graphs with applications to subgraph count statistics
- Random subgraph counts and U-statistics: multivariate normal approximation via exchangeable pairs and embedding
- scientific article; zbMATH DE number 3943865 (Why is no real title available?)
- Random association of symmetric arrays
- Asymptotic normality of some Graph-Related statistics
- scientific article; zbMATH DE number 17683 (Why is no real title available?)
- Incomplete U -statistics of permanent design
- Subgraph statistics in subcritical graph classes
- Compound Poisson approximation of subgraph counts in stochastic block models with multiple edges
- On the propagation of low-rate measurement error to subgraph counts in large networks
- A local central limit theorem for triangles in a random graph
- Asymptotic for the cumulative distribution function of the degrees and homomorphism densities for random graphs sampled from a graphon
- A limit theorem for small cliques in inhomogeneous random graphs
- Fluctuations of subgraph counts in graphon based random graphs
- Local limit theorems for subgraph counts
- Normal approximation of subgraph counts in the random-connection model
- Moderate deviations for functionals over infinitely many Rademacher random variables
- Local central limit theorem for triangle counts in sparse random graphs
- Functional central limit theorem for the simultaneous subgraph count of dynamic Erdős-Rényi random graphs
- Goodness-of-fit testing based on graph functionals for homogeneous Erdős-Rényi graphs
- A short proof of a central limit theorem for the order of the giant component and k-core
- Higher-order graphon theory: fluctuations, degeneracies and inference
- Optimal subgraphs in geometric scale-free random graphs
- On computing and the complexity of computing higher-order U-statistics, exactly
- The asymptotic distributions of generalized U-statistics with applications to random graphs
- Subsampling bootstrap of count features of networks
- Variance of the subgraph count for sparse Erdős-Rényi graphs
This page was built for publication: Subgraph counts in random graphs using incomplete U-statistics methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1119948)
