Bootstrapping networks with latent space structure
From MaRDI portal
Cites work
- \(U\)-statistics, \(M_m\)-estimators and resampling
- A Class of Statistics with Asymptotically Normal Distribution
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- A goodness-of-fit test for stochastic block models
- A kernel two-sample test
- A nonparametric two-sample hypothesis testing problem for random graphs
- A statistical interpretation of spectral embedding: the generalised random dot product graph
- A useful variant of the Davis-Kahan theorem for statisticians
- Approximation Theorems of Mathematical Statistics
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator
- Automatic dimensionality selection from the scree plot via the use of profile likelihood
- Bootstrap With Cluster‐Dependence in Two or More Dimensions
- Bootstrapping exchangeable random graphs
- CLT for linear spectral statistics of large-dimensional sample covariance matrices.
- Community detection and stochastic block models
- Consistency of maximum likelihood for continuous-space network models. I
- Consistency of spectral clustering in stochastic block models
- Consistency of the generalized bootstrap for degenerate \(U\)-statistics
- Consistent adjacency-spectral partitioning for the stochastic block model when the model parameters are unknown
- Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
- Edgeworth expansions for network moments
- Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure
- Empirical process results for exchangeable arrays
- Energy statistics: a class of statistics based on distances
- Estimation of Subgraph Densities in Noisy Networks
- Graph similarity and distance in graphs
- scientific article; zbMATH DE number 7625156 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Hypothesis testing for automated community detection in networks
- Large networks and graph limits
- Latent Space Approaches to Social Network Analysis
- Mixed membership stochastic blockmodels
- Network cross-validation by edge sampling
- Network dependence testing via diffusion maps and distance-based correlations
- Network representation using graph root distributions
- Networks. An introduction.
- On the bootstrap of \(U\) and \(V\) statistics
- Optimal change point detection and localization in sparse dynamic networks
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Random Dot Product Graph Models for Social Networks
- Randomized incomplete \(U\)-statistics in high dimensions
- Resampling methods for dependent data
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Some asymptotic theory for the bootstrap
- Some properties of incomplete U-statistics
- Spectra of edge-independent random graphs
- Statistical inference on random dot product graphs: a survey
- Subsampling bootstrap of count features of networks
- Subsampling sparse graphons under minimal assumptions
- Testing and modeling dependencies between a network and nodal attributes
- Testing in high-dimensional spiked models
- The method of moments and degree distributions for network models
- The weighted bootstrap
- Universal rank inference via residual subsampling with application to large networks
Cited in
(6)- Nonparametric two-sample hypothesis testing for low-rank random graphs of differing sizes
- Characterization of the asymptotic behaviour of U-statistics on row-column exchangeable matrices
- An overview of asymptotic normality in stochastic blockmodels: cluster analysis and inference
- An omnibus embedding of multiple random graphs and implications for multiscale network inference
- Weighted random dot product graphs
- Higher-order graphon theory: fluctuations, degeneracies and inference
This page was built for publication: Bootstrapping networks with latent space structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7016763)
