Delves into social and information networks dynamics, including herding behavior, information cascades, preferential attachment, and the Friendship Paradox.
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
