Premium
Navigating the Range of Statistical Tools for Inferential Network Analysis
Author(s) -
Cranmer Skyler J.,
Leifeld Philip,
McClurg Scott D.,
Rolfe Meredith
Publication year - 2017
Publication title -
american journal of political science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 6.347
H-Index - 170
eISSN - 1540-5907
pISSN - 0092-5853
DOI - 10.1111/ajps.12263
Subject(s) - exponential random graph models , computer science , statistical inference , inference , network analysis , data science , range (aeronautics) , contingency table , strengths and weaknesses , graph , data mining , machine learning , artificial intelligence , random graph , theoretical computer science , statistics , mathematics , engineering , psychology , aerospace engineering , electrical engineering , social psychology
The last decade has seen substantial advances in statistical techniques for the analysis of network data, as well as a major increase in the frequency with which these tools are used. These techniques are designed to accomplish the same broad goal, statistically valid inference in the presence of highly interdependent relationships, but important differences remain between them. We review three approaches commonly used for inferential network analysis—the quadratic assignment procedure, exponential random graph models, and latent space network models—highlighting the strengths and weaknesses of the techniques relative to one another. An illustrative example using climate change policy network data shows that all three network models outperform standard logit estimates on multiple criteria. This article introduces political scientists to a class of network techniques beyond simple descriptive measures of network structure, and it helps researchers choose which model to use in their own research.