This course will introduce tools and methodology for analyzing complex social systems with network models. The first half of the course will cover standard network constructions and associated centrality metrics, clustering algorithms, dynamical models, and null models through classic papers and examples from the field. The second half of the course will focus on the discrete formulation of political redistricting problems and related applications of sampling connected graph partitions. In addition to the theoretical components, this course will provide resources and experiences for relevant software packages including networkx and gerrychain.
- Introduction to NetworkX and Overview
- Measures and Metrics
- Null Models
- Dynamics 1 (Diffusion)
- Dynamics 2 (Compartment Models)
- Clustering Methods 1 (Spectral Methods)
- Clustering Methods 2 (Kitchen Sink)
- Multiplex Networks
- Applied Examples (Social Networks)
- Introduction to Computational Redistricting
- Geospatial Data
- MCMC and Ensembles
- Graph Partitioning
- Applied Examples (Gerrymandering)
- Applied Examples (Reform)
|
|
|
|
|
|
| ReCom Ensemble | Boundary Ensemble |
 |  |