Explores unstructured and structured search and routing protocols, emphasizing the importance of network structure assumptions and introducing the 'Bubble Storm' algorithm.
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.
Explores weak ties' significance in social networks, job finding, and information diffusion, emphasizing the Triadic Closure principle and the paradox of weak ties in job finding.
