Bayesian analysis for exponential random graph models using the adaptive exchange sampler
From MaRDI portal
(Redirected from Publication:896598)
Recommendations
- Approximate Bayesian computation for exponential random graph models for large social networks
- Auxiliary parameter MCMC for exponential random graph models
- Consistency under sampling of exponential random graph models
- Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks
- Adjusting for network size and composition effects in exponential-family random graph models
Cited in
(13)- Bayesian indirect inference for models with intractable normalizing functions
- Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks
- A novel simulation method for binary discrete exponential families, with application to social networks
- Analysing exponential random graph (p-star) models with missing data using Bayesian data augmentation
- Exponential-family models of random graphs: inference in finite, super and infinite population scenarios
- Bayesian model selection for high-dimensional Ising models, with applications to educational data
- Approximate Bayesian computation for exponential random graph models for large social networks
- Bayesian inference in the presence of intractable normalizing functions
- An overview of stochastic approximation Monte Carlo
- A Function Emulation Approach for Doubly Intractable Distributions
- A perfect sampling method for exponential family random graph models
- scientific article; zbMATH DE number 6253970 (Why is no real title available?)
- Auxiliary parameter MCMC for exponential random graph models
This page was built for publication: Bayesian analysis for exponential random graph models using the adaptive exchange sampler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896598)
