Inferential network analysis with exponential random graph models

339Citations
Citations of this article
440Readers
Mendeley users who have this article in their library.

Abstract

Methods for descriptive network analysis have reached statistical maturity and general acceptance across the social sciences in recent years. However, methods for statistical inference with network data remain fledgling by comparison. We introduce and evaluate a general model for inference with network data, the Exponential Random Graph Model (ERGM) and several of its recent extensions. The ERGM simultaneously allows both inference on covariates and for arbitrarily complex network structures to be modeled. Our contributions are three-fold: beyond introducing the ERGM and discussing its limitations, we discuss extensions to the model that allow for the analysis of non-binary and longitudinally observed networks and show through applications that network-based inference can improve our understanding of political phenomena. © The Author 2010. Published by Oxford University Press on behalf of the Society for Political Methodology. All rights reserved.

Cite

CITATION STYLE

APA

Cranmer, S. J., & Desmarais, B. A. (2011). Inferential network analysis with exponential random graph models. Political Analysis, 19(1), 66–86. https://doi.org/10.1093/pan/mpq037

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free