Explores the stochastic blockmodel, spectral clustering, and non-parametric understanding of blockmodels, emphasizing metrics for comparing graph models.
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.