Approximate Bayesian Computation for Exponential Random Graph Models for Large Social Networks

DOI10.1080/03610918.2012.703359zbMath1323.65007OpenAlexW1990111666MaRDI QIDQ5417929

Yves F. Atchadé, Jing Wang

Publication date: 23 May 2014

Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610918.2012.703359

zbMATH Keywords

Markov chain Monte Carlo methodBayesian inferenceexponential random graph modelintractable normalizing constantslarge social networks

Mathematics Subject Classification ID

Related Items (5)

An approximate likelihood perspective on ABC methods ⋮ Exponential-family models of random graphs: inference in finite, super and infinite population scenarios ⋮ Auxiliary parameter MCMC for exponential random graph models ⋮ Model comparison for Gibbs random fields using noisy reversible jump Markov chain Monte Carlo ⋮ Bayesian Model Selection for Exponential Random Graph Models via Adjusted Pseudolikelihoods

Uses Software

• tsbridge

Cites Work

• Unnamed Item
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• A double Metropolis–Hastings sampler for spatial models with intractable normalizing constants
• Exact sampling with coupled Markov chains and applications to statistical mechanics
• An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants

This page was built for publication: Approximate Bayesian Computation for Exponential Random Graph Models for Large Social Networks