An introduction to exponential random graph (p*) models for social networks

  title={An introduction to exponential random graph (p*) models for social networks},
  author={Garry Robins and Philippa Pattison and Yuval Kalish and Dean Lusher},
  journal={Soc. Networks},

Figures from this paper

Recent developments in exponential random graph (p*) models for social networks
Exponential Random Graph (p*) Models as a Method for Social Network Analysis in Communication Research
A new class of social network analysis methods, exponential random graph (p*) models, are introduced, allowing for the simultaneous estimation of attribute and structural parameters, accounting for the interdependent nature of network data, and retaining the complexity of network observations throughout the analysis.
Bayesian model selection for exponential random graph models
What Are Exponential Random Graph Models
The idea of a graph is a powerful simplification for different phenomena-a way of specifying pairwise relations among a collection of items or agents.
Statistical Models for Social Networks
This review first treats models for single (cross-sectionally observed) networks and then for network dynamics, and actor-oriented models here provide a model that can represent many dependencies in a flexible way.


New Specifications for Exponential Random Graph Models
It is concluded that the new specifications of exponential random graph models increase the range and applicability of the ERGM as a tool for the statistical analysis of social networks.
Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp
A large class of models, including several generalizations of stochastic block models, as well as models parameterizing global tendencies towards clustering and centralization, and individual differences in such tendencies are described and extended.
Markov Chain Monte Carlo Estimation of Exponential Random Graph Models
  • T. Snijders
  • Computer Science, Mathematics
    J. Soc. Struct.
  • 2002
This paper is about estimating the parameters of the exponential random graph model using frequentist Markov chain Monte Carlo (MCMC) methods, based on the Robbins-Monro algorithm for approximating a solution to the likelihood equation.
Logit models and logistic regressions for social networks: II. Multivariate relations.
  • P. Pattison, S. Wasserman
  • Computer Science, Mathematics
    The British journal of mathematical and statistical psychology
  • 1999
This paper shows how to formulate models for multivariate social networks by considering a range of theoretical claims about social structure, and illustrates the models by developing structural models for several multivariate networks.
The statistical evaluation of social network dynamics
A class of statistical models is proposed for longitudinal network data that are continuous-time Markov chain models that can be implemented as simulation models and statistical procedures are proposed that are based on the method of moments.
Pseudolikelihood Estimation for Social Networks
The focus of this article is on a general estimation technique that maximizes the pseudolikelihood, the maximum likelihood of log-linear modeling for social-network data.
Inference in Curved Exponential Family Models for Networks
This article first reviews the method of maximum likelihood estimation using Markov chain Monte Carlo in the context of fitting linear ERGMs, then extends this methodology to the situation where the model comes from a curved exponential family.
Network models for social selection processes
A p* primer: logit models for social networks