Hostname: page-component-77f85d65b8-t6st2 Total loading time: 0 Render date: 2026-04-18T21:17:37.137Z Has data issue: false hasContentIssue false

Inferential Network Analysis with Exponential Random Graph Models

Published online by Cambridge University Press:  04 January 2017

Skyler J. Cranmer*
Affiliation:
Department of Political Science, University of North Carolina at Chapel Hill, 311 Hamilton Hall, Chapel Hill, NC 27599
Bruce A. Desmarais
Affiliation:
Department of Political Science, University of Massachusetts Amherst, Thompson Hall, 200 Hicks Way, Amherst, MA 01003. e-mail: desmarais@polsci.umass.edu
*
e-mail: skyler@unc.edu (corresponding author)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © The Author 2010. Published by Oxford University Press on behalf of the Society for Political Methodology 
Supplementary material: PDF

Cranmer and Desmarais supplementary material

Appendix

Download Cranmer and Desmarais supplementary material(PDF)
PDF 188 KB