Efficient Bayesian inference for exponential random graph models by correcting the pseudo-posterior distribution

Exponential random graph models are an important tool in the statistical analysis of data. However, Bayesian parameter estimation for these models is extremely challenging, since evaluation of the posterior distribution typically involves the calculation of an intractable normalizing constant. This barrier motivates the consideration of tractable approximations to the likelihood function, such as the pseudolikelihood function, which offers an approach to constructing such an approximation. Naive implementation of what we term a pseudo-posterior resulting from replacing the likelihood function in the posterior distribution by the pseudolikelihood is likely to give misleading inferences. We provide practical guidelines to correct a sample from such a pseudo-posterior distribution so that it is approximately distributed from the target posterior distribution and discuss the computational and statistical efficiency that result from this approach. We illustrate our methodology through the analysis of real-world graphs. Comparisons against the approximate exchange algorithm of Caimo and Friel (2011) are provided, followed by concluding remarks.

[1]  W. K. Hastings,et al.  Monte Carlo Sampling Methods Using Markov Chains and Their Applications , 1970 .

[2]  Anthony N. Pettitt,et al.  Bayesian Inference in Hidden Markov Random Fields for Binary Data Defined on Large Lattices , 2009 .

[3]  Zoubin Ghahramani,et al.  MCMC for Doubly-intractable Distributions , 2006, UAI.

[4]  Garry Robins,et al.  An introduction to exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[5]  Martina Morris,et al.  ergm: A Package to Fit, Simulate and Diagnose Exponential-Family Models for Networks. , 2008, Journal of statistical software.

[6]  Guy Bresler,et al.  Mixing Time of Exponential Random Graphs , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Alberto Caimo,et al.  Bayesian inference for exponential random graph models , 2010, Soc. Networks.

[8]  J. Møller,et al.  An efficient Markov chain Monte Carlo method for distributions with intractable normalising constants , 2006 .

[9]  David W. Hosmer,et al.  Applied Logistic Regression , 1991 .

[10]  Bruce A. Desmarais,et al.  Inferential Network Analysis with Exponential Random Graph Models , 2011, Political Analysis.

[11]  Tim Hesterberg,et al.  Monte Carlo Strategies in Scientific Computing , 2002, Technometrics.

[12]  H. Robbins.  A Stochastic Approximation Method , 1951 .

[13]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[14]  Harry Joe,et al.  Composite Likelihood Methods , 2012 .

[15]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[16]  D. J. Strauss,et al.  Pseudolikelihood Estimation for Social Networks , 1990 .

[17]  R Core Team,et al.  R: A language and environment for statistical computing. , 2014 .

[18]  Alberto Caimo,et al.  Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks , 2014, Stat. Comput..

[19]  David Bruce Wilson,et al.  Exact sampling with coupled Markov chains and applications to statistical mechanics , 1996, Random Struct. Algorithms.

[20]  P. Pattison,et al.  New Specifications for Exponential Random Graph Models , 2006 .

[21]  Alberto Caimo,et al.  Bergm: Bayesian Exponential Random Graphs in R , 2012, 1201.2770.

[22]  J. Besag.  Efficiency of pseudolikelihood estimation for simple Gaussian fields , 1977 .

[23]  Marko Bajec,et al.  Robust network community detection using balanced propagation , 2011, ArXiv.

[24]  Laura Ventura,et al.  Bayesian composite marginal likelihoods , 2011 .

[25]  D. Hunter,et al.  Inference in Curved Exponential Family Models for Networks , 2006 .

[26]  Peng Wang,et al.  Recent developments in exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[27]  R. Dudley.  Distances of Probability Measures and Random Variables , 1968 .

[28]  M. Newman,et al.  Solution of the two-star model of a network. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[29]  N. Reid,et al.  AN OVERVIEW OF COMPOSITE LIKELIHOOD METHODS , 2011 .

[30]  Nial Friel,et al.  Calibration of conditional composite likelihood for Bayesian inference on Gibbs random fields , 2015, AISTATS.

[31]  S. Wasserman,et al.  Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp , 1996 .

[32]  Martina Morris,et al.  A statnet Tutorial. , 2008, Journal of statistical software.

[33]  Garry Robins,et al.  Analysing exponential random graph (p-star) models with missing data using Bayesian data augmentation , 2010 .

[34]  M. Huber.  Perfect sampling using bounding chains , 2004, math/0405284.

[35]  Richard G. Everitt,et al.  Bayesian Parameter Estimation for Latent Markov Random Fields and Social Networks , 2012, ArXiv.

[36]  Alberto Caimo,et al.  Bayesian model selection for exponential random graph models , 2012, Soc. Networks.

[37]  J. Besag.  Statistical Analysis of Non-Lattice Data , 1975 .

[38]  Mark S. Handcock,et al.  A framework for the comparison of maximum pseudo-likelihood and maximum likelihood estimation of exponential family random graph models , 2009, Soc. Networks.