Bayesian Model Selection for Exponential Random Graph Models via Adjusted Pseudolikelihoods
From MaRDI portal
Publication:3391082
DOI10.1080/10618600.2018.1448832OpenAlexW3099078835WikidataQ115550154 ScholiaQ115550154MaRDI QIDQ3391082
Florian Maire, Nial Friel, Lampros Bouranis
Publication date: 28 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1706.06344
Related Items
Bayesian Variational Inference for Exponential Random Graph Models ⋮ Bayesian Shrinkage for Functional Network Models, With Applications to Longitudinal Item Response Data ⋮ Finite mixtures of ERGMs for modeling ensembles of networks ⋮ Bayesian model selection for high-dimensional Ising models, with applications to educational data ⋮ A multilayer exponential random graph modelling approach for weighted networks ⋮ Model comparison for Gibbs random fields using noisy reversible jump Markov chain Monte Carlo
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bayesian model comparison with un-normalised likelihoods
- Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
- Improving power posterior estimation of statistical evidence
- Estimating Bayes factors via thermodynamic integration and population MCMC
- Optimal scaling for various Metropolis-Hastings algorithms.
- A comparative study of Monte Carlo methods for efficient evaluation of marginal likelihood
- Bayesian Inference from Composite Likelihoods, with an Application to Spatial Extremes
- Marginal Likelihood from the Gibbs Output
- Sequential Monte Carlo Samplers
- Efficient recursions for general factorisable models
- Marginal Likelihood Estimation via Power Posteriors
- Efficiency of pseudolikelihood estimation for simple Gaussian fields
- Marginal Likelihood From the Metropolis–Hastings Output
- Bayes Factors
- Approximate Bayesian Computation for Exponential Random Graph Models for Large Social Networks
- Recursive computing and simulation-free inference for general factorizable models
- An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants
- Simulating normalizing constants: From importance sampling to bridge sampling to path sampling
- Monte Carlo strategies in scientific computing
- Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks
