On estimation and inference in latent structure random graphs
From MaRDI portal
Publication:2038286
DOI10.1214/20-STS787OpenAlexW3113515731MaRDI QIDQ2038286
Youngser Park, Minh Tang, Avanti Athreya, Carey E. Priebe
Publication date: 6 July 2021
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.01401
Related Items (5)
Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Efficient Estimation for Random Dot Product Graphs via a One-Step Procedure ⋮ On coregionalized multivariate Gaussian Markov random fields: construction, parameterization, and Bayesian estimation and inference ⋮ Localization in 1D non-parametric latent space models from pairwise affinities ⋮ Spectral Estimation of Large Stochastic Blockmodels with Discrete Nodal Covariates
Cites Work
- Unnamed Item
- A nonparametric two-sample hypothesis testing problem for random graphs
- A limit theorem for scaled eigenvectors of random dot product graphs
- Perfect clustering for stochastic blockmodel graphs via adjacency spectral embedding
- Vertex nomination schemes for membership prediction
- Statistical modeling: The two cultures. (With comments and a rejoinder).
- Bézier and B-spline techniques
- Weak convergence and empirical processes. With applications to statistics
- The geometry of continuous latent space models for network data
- The two-to-infinity norm and singular subspace geometry with applications to high-dimensional statistics
- Introduction to Smooth Manifolds
- Mixed membership stochastic blockmodels
- Graph limits and exchangeable random graphs
- Latent Space Approaches to Social Network Analysis
- Statistical inference on random dot product graphs: a survey
- A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs
- The phase transition in inhomogeneous random graphs
- Random Dot Product Graph Models for Social Networks
This page was built for publication: On estimation and inference in latent structure random graphs
