Explores unstructured and structured search and routing protocols, emphasizing the importance of network structure assumptions and introducing the 'Bubble Storm' algorithm.
Covers algorithmic paradigms for dynamic graph problems, including dynamic connectivity, expander decomposition, and local clustering, breaking barriers in k-vertex connectivity problems.
Delves into social and information networks dynamics, including herding behavior, information cascades, preferential attachment, and the Friendship Paradox.
Explores the social dynamics of adoption and contagion on complex networks, emphasizing the emergence of novelties and the impact of social interactions.