RSS02.E4 Inferential Network Analysis
Inferential Network Analysis introduces statistical methods for analyzing networks. Networks, or graphs, are sets of nodes and their connecting ties. Networks are used to model a wide range of complex political phenomena, such as policy networks among political actors around the design of:
- new regulation;
- lobbying ties of interest groups to policy makers or lobbying coalitions;
- recruitment of experts into international organizations;
- patronage relationships;
- multilevel or collaborative governance systems;
- international relations, including conflict, alliances, trade, and migration;
- financial deals between organizations;
- political debates among actors about policies; or the diffusion of policies among states.
Systems like these usually evolve over time in complex ways, and as researchers we want to understand the formation of ties between nodes at the micro level in order to understand how the system evolves. We also want to understand the adoption of behavior as a consequence of being embedded in a network. The central questions are:
- How can we model any datasets where the observations are not independent and identically distributed (i.i.d.)?
- How can we explain and model connections between nodes (or characteristics of nodes) using covariate data and theories about the endogeneity in the data?
- And how can we simulate such processes forward in time to predict future states of the network or the characteristics of the nodes?
The course “Inferential Network Analysis” introduces a range of statistical models for explaining and predicting the formation of ties in networks using characteristics of the nodes, their ties, and the network. After introducing real-world examples and establishing terminology, we will consider the exponential random graph model (ERGM) as the workhorse model of statistical network analysis in the first half of the course, including specification, estimation, and implementation in R. We will then discuss extensions to temporal and valued relations before we consider alternative modeling choices, including the family of latent space models, the quadratic assignment procedure, the stochastic actor-oriented model, and the relational event model. Finally, we will also discuss the use of network autocorrelation models to explain the state or behavior of a node by considering the node’s network embeddedness.
All models will be discussed theoretically, in application, and practically using R. Participants will be given daily assignments to solve after class to maximize the learning experience. Participants should have a working knowledge of logistic regression before participating in the course, and they will be expected to solve tasks in R. While this is not a course about R, students would hence benefit most from having a working knowledge of R before joining the course.
|26 June 2023 - 30 June 2023|
Early Bird Regular: €895 (application deadline* April 1st)
|Scholarships and discounts||Find more information here|
*Your application is only completed when the course fee has been paid
|Course leader||Philip Leifeld|
|Level of participant||
|Mode of Study||On Campus|
|ECTS||2 or 4 Find more information here|