Network representation using graph root distributions
From MaRDI portal
Publication:2039784
DOI10.1214/20-AOS1976zbMath1468.62258arXiv1802.09684OpenAlexW3149163435MaRDI QIDQ2039784
Publication date: 5 July 2021
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.09684
Nonparametric estimation (62G05) Random graphs (graph-theoretic aspects) (05C80) Inference from stochastic processes and spectral analysis (62M15) Characterization and structure theory of statistical distributions (62E10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A nonparametric two-sample hypothesis testing problem for random graphs
- Fast community detection by SCORE
- Network Cross-Validation for Determining the Number of Communities in Network Data
- Rate-optimal graphon estimation
- Oracle inequalities for network models and sparse graphon estimation
- Asymptotic equivalence of functional linear regression and a white noise inverse problem
- Spectral clustering and the high-dimensional stochastic blockmodel
- The method of moments and degree distributions for network models
- Methodology and convergence rates for functional linear regression
- Statistical analysis of network data. Methods and models
- On the representation theorem for exchangeable arrays
- Representations for partially exchangeable arrays of random variables
- Community detection in degree-corrected block models
- Consistency of community detection in networks under degree-corrected stochastic block models
- Convergence and concentration of empirical measures under Wasserstein distance in unbounded functional spaces
- Optimal graphon estimation in cut distance
- Matrix estimation by universal singular value thresholding
- A nonparametric view of network models and Newman–Girvan and other modularities
- Mixed membership stochastic blockmodels
- Graph Partitioning via Adaptive Spectral Techniques
- Random Geometric Graphs
- Statistical inference on random dot product graphs: a survey
- Edge Exchangeable Models for Interaction Networks
- Sparse Graphs Using Exchangeable Random Measures
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- Adaptive Global Testing for Functional Linear Models
- A Survey of Statistical Network Models
- The phase transition in inhomogeneous random graphs
- Latent Space Models for Dynamic Networks
- Estimating network edge probabilities by neighbourhood smoothing
- Networks
- A goodness-of-fit test for stochastic block models
This page was built for publication: Network representation using graph root distributions
