The geometry of continuous latent space models for network data
From MaRDI portal
Publication:2292395
DOI10.1214/19-STS702zbMath1429.62433arXiv1712.08641OpenAlexW2979763532WikidataQ102379572 ScholiaQ102379572MaRDI QIDQ2292395
Catherine A. Calder, Anna L. Smith, Dena M. Asta
Publication date: 3 February 2020
Published in: Statistical Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.08641
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Neural nets and related approaches to inference from stochastic processes (62M45)
Related Items (14)
Latent structure blockmodels for Bayesian spectral graph clustering ⋮ Large-scale estimation of random graph models with local dependence ⋮ A latent space diffusion item response theory model to explore conditional dependence between responses and response times ⋮ A semiparametric Bayesian approach to epidemics, with application to the spread of the coronavirus MERS in South Korea in 2015 ⋮ Graph sequences sampled from Robinson graphons ⋮ Entropic Optimal Transport on Random Graphs ⋮ Random geometric graph: some recent developments and perspectives ⋮ Bayesian Markov-Switching Tensor Regression for Time-Varying Networks ⋮ Phase transition in noisy high-dimensional random geometric graphs ⋮ Consistency of maximum likelihood for continuous-space network models. I ⋮ Joint Latent Space Model for Social Networks with Multivariate Attributes ⋮ On estimation and inference in latent structure random graphs ⋮ Mapping unobserved item-respondent interactions: a latent space item response model with interaction map ⋮ Spatial voting models in circular spaces: a case study of the U.S. House of Representatives
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-likelihood methods for community detection in large sparse networks
- Network Cross-Validation for Determining the Number of Communities in Network Data
- Rate-optimal graphon estimation
- Hyperbolic graph generator
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Logratio analysis and compositional distance.
- Estimation and prediction for stochastic blockmodels for graphs with latent block structure
- A hyperbolic filling for ultrametric spaces
- A nonparametric view of network models and Newman–Girvan and other modularities
- Exact Recovery in the Stochastic Block Model
- Latent Variable Models and Factor Analysis
- Mixed membership stochastic blockmodels
- Emergence of Scaling in Random Networks
- Graph limits and exchangeable random graphs
- Markov Graphs
- An Exponential Family of Probability Distributions for Directed Graphs
- Pictures of Ultrametric Spaces, the p-Adic Numbers, and Valued Fields
- Latent Space Approaches to Social Network Analysis
- p2: a random effects model with covariates for directed graphs
- Statistical Analysis of Network Data with R
- Collective dynamics of ‘small-world’ networks
- Latent Space Models for Dynamic Networks
- Latent Surface Models for Networks Using Aggregated Relational Data
- Random Dot Product Graph Models for Social Networks
- Learning Theory
- Random Graphs
- Bilinear Mixed-Effects Models for Dyadic Data
This page was built for publication: The geometry of continuous latent space models for network data
