Computationally efficient inference for latent position network models
From MaRDI portal
Publication:6597256
Cites work
- Adaptive Rejection Metropolis Sampling within Gibbs Sampling
- Analysis of the formation of the structure of social networks by using latent space models for ranked dynamic networks
- Estimation and Prediction for Stochastic Blockstructures
- General state space Markov chains and MCMC algorithms
- Informed sub-sampling MCMC: approximate Bayesian inference for large datasets
- Latent Space Approaches to Social Network Analysis
- Latent space models for dynamic networks
- Latent space models for multiview network data
- Locally adaptive dynamic networks
- Modeling heterogeneity in random graphs through latent space models: a selective review
- Noisy Monte Carlo: convergence of Markov chains with approximate transition kernels
- Perturbation theory for Markov chains via Wasserstein distance
- Random Plane Networks
- Review of statistical network analysis: models, algorithms, and software
- Sensitivity and convergence of uniformly ergodic Markov chains
- Stochastic Blockmodels for Directed Graphs
- Two convergence properties of hybrid samplers
- Variational Bayesian inference for the latent position cluster model for network data
This page was built for publication: Computationally efficient inference for latent position network models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6597256)
