Projective, sparse and learnable latent position network models
DOI10.1214/23-aos2340zbMath1530.05176arXiv1709.09702OpenAlexW2914572355MaRDI QIDQ6183873
Cosma Rohilla Shalizi, Neil A. Spencer
Publication date: 4 January 2024
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.09702
network modelsrandom geometric graphprojective familylatent space modelconsistent estimationnetwork sparsitylatent position network model
Non-Markovian processes: estimation (62M09) Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Interacting random processes; statistical mechanics type models; percolation theory (60K35)
Cites Work
- Unnamed Item
- Unnamed Item
- Consistency under sampling of exponential random graph models
- Recovering the structure of random linear graphs
- A statistical framework for modern network science
- On the estimation of latent distances using graph distances
- Matrix estimation by universal singular value thresholding
- Conditional Marginalization for Exponential Random Graph Models
- On a continuum percolation model
- Graph limits and exchangeable random graphs
- Random Plane Networks
- The Structure and Function of Complex Networks
- Random Geometric Graphs
- Latent Space Approaches to Social Network Analysis
- Sparse exchangeable graphs and their limits via graphon processes
- Sparse Graphs Using Exchangeable Random Measures
- Continuum Percolation
- Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities
- Learning random points from geometric graphs or orderings
- 1-Bit matrix completion
- An 𝐿^{𝑝} theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions
- A useful variant of the Davis–Kahan theorem for statisticians
- The phase transition in inhomogeneous random graphs
- Bilinear Mixed-Effects Models for Dyadic Data
- Networks
