Edgeworth expansions for network moments
From MaRDI portal
Publication:2131253
DOI10.1214/21-AOS2125zbMath1486.62053arXiv2004.06615MaRDI QIDQ2131253
Publication date: 25 April 2022
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.06615
Edgeworth expansionmethod of momentsnetwork inferencenetwork bootstrapnetwork jackknifenoisy U-statistic
Asymptotic distribution theory in statistics (62E20) Nonparametric estimation (62G05) Central limit and other weak theorems (60F05) Random graphs (graph-theoretic aspects) (05C80)
Related Items
Time‐varying β‐model for dynamic directed networks ⋮ Asymptotic theory in network models with covariates and a growing number of node parameters ⋮ Asymptotic theory in bipartite graph models with a growing number of parameters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Likelihood-based model selection for stochastic block models
- A nonparametric two-sample hypothesis testing problem for random graphs
- Rate-optimal graphon estimation
- Minimax rates of community detection in stochastic block models
- Oracle inequalities for network models and sparse graphon estimation
- Edgeworth expansion for Student's t statistic under minimal moment conditions
- Inverting an Edgeworth expansion
- The method of moments and degree distributions for network models
- Community detection in sparse networks via Grothendieck's inequality
- On the Edgeworth expansion and the bootstrap approximation for a Studentized U-statistic
- Subsampling bootstrap of count features of networks
- Edgeworth series for lattice distributions
- On normal approximations to \(U\)-statistics
- Edgeworth expansions for sampling without replacement from finite populations
- On the rate of convergence in the central limit theorem for martingales with discrete and continuous time
- Singh's theorem in the lattice case
- On Edgeworth expansions in the mixture cases
- Subgraph counts in random graphs using incomplete U-statistics methods
- An Edgeworth expansion for U-statistics
- The order of the normal approximation for a Studentized U-statistic
- Rate of convergence in the central limit theorem and in the strong law of large numbers for von Mises statistics
- Representations for partially exchangeable arrays of random variables
- On the asymptotic accuracy of Efron's bootstrap
- The Berry-Esseen theorem for U-statistics
- On the validity of the formal Edgeworth expansion
- An Edgeworth expansion for symmetric statistics
- Edgeworth expansions of a studentized \(U\)-statistic and a jackknife estimator of variance
- An Edgeworth expansion for studentized finite population statistics
- Edgeworth expansion for \(U\)-statistics under minimal conditions.
- An Edgeworth expansion for the \(m\) out of \(n\) bootstrapped median
- A critical threshold for design effects in network sampling
- On the rate of convergence in the central limit theorem for martingale difference sequences
- Community detection in degree-corrected block models
- Empirical Edgeworth expansions for symmetric statistics
- The Edgeworth expansion for U-statistics of degree two
- Edgeworth expansions in nonparametric statistics
- Orthogonal decomposition of finite population statistics and its applications to distributional asymptotics
- Connected components in random graphs with given expected degree sequences
- An Edgeworth expansion for symmetric finite population statistics
- Uniform coverage bounds for confidence intervals and Berry-Esseen theorems for Edgeworth expansion
- Lower estimates of the convergence rate for \(U\)-statistics
- Consistency of community detection in networks under degree-corrected stochastic block models
- Distributed statistical inference for massive data
- Community detection on mixture multilayer networks via regularized tensor decomposition
- Theoretical and computational guarantees of mean field variational inference for community detection
- Approximating high-dimensional infinite-order \(U\)-statistics: statistical and computational guarantees
- Randomized incomplete \(U\)-statistics in high dimensions
- Robust and computationally feasible community detection in the presence of arbitrary outlier nodes
- Bootstrapping the studentized sample mean of lattice variables
- Moments of two-variable functions and the uniqueness of graph limits
- Co-clustering of nonsmooth graphons
- An optimal Berry-Esseen type inequality for expectations of smooth functions
- A weak Cramér condition and application to Edgeworth expansions
- Optimal hypothesis testing for high dimensional covariance matrices
- Optimal Estimation and Completion of Matrices with Biclustering Structures
- Stochastic blockmodels with a growing number of classes
- A nonparametric view of network models and Newman–Girvan and other modularities
- Mixed membership stochastic blockmodels
- Asymptotic Approximations to Distributions
- The Percentile Points of Distributions Having Known Cumulants
- Graph limits and exchangeable random graphs
- Mixture models and exploratory analysis in networks
- Very large graphs
- Some properties of incomplete U-statistics
- Latent Space Approaches to Social Network Analysis
- Community Detection and Stochastic Block Models
- New Consistent and Asymptotically Normal Parameter Estimates for Random-Graph Mixture Models
- The Mathematics of Data
- A uniform-in-P Edgeworth expansion under weak Cramér conditions
- Jackknife empirical likelihood: small bandwidth, sparse network and high-dimensional asymptotics
- Detecting Overlapping Communities in Networks Using Spectral Methods
- Testing for Equivalence of Network Distribution Using Subgraph Counts
- Statistical Inferences of Linear Forms for Noisy Matrix Completion
- Degree‐based goodness‐of‐fit tests for heterogeneous random graph models: Independent and exchangeable cases
- DESIGN BASED INCOMPLETE U-STATISTICS
- Detecting different topologies immanent in scale-free networks with the same degree distribution
- Collective dynamics of ‘small-world’ networks
- Estimating network edge probabilities by neighbourhood smoothing
- Using the bootstrap for statistical inference on random graphs
- On the Departure from Normality of a Certain Class of Martingales
- All of Nonparametric Statistics
- A Class of Statistics with Asymptotically Normal Distribution
- Asymptotics in directed exponential random graph models with an increasing bi-degree sequence
- A goodness-of-fit test for stochastic block models
