Research work · 2002

Markov chain Monte Carlo estimation of exponential random graph models

Tom A. B. Snijders

Abstract

This paper is about estimating the parameters of the exponential random graph model, also known as the p # model, using frequentist Markov chain Monte Carlo (MCMC) methods. The exponential random graph model is simulated using Gibbs or Metropolis-Hastings sampling. The estimation procedures considered are based on the Robbins-Monro algorithm for approximating a solution to the likelihood equation.