Closed-Loop Control of Network Processes

on YouTube ↗35m

" summary

Presents a closed‑loop treatment of the SIS epidemic on a graph, modeling infections as a SIS continuous-time Markov chain and curing as a reallocatable budget. Proves a threshold: if curing budget exceeds the graph’s cut width (mesh ~ cut width ~ sqrt(N)), a policy that tracks a deterministic crusade drives rapid extinction; if budget falls below the cut width extinction time becomes exponential. Builds a provable, stylized policy (shooting resources at one node at a time) and documents many practical gaps.

AI-written summary · about

" chapters (10)

1. 0:00Introduction
2. 3:24Network Science
3. 5:43Static Interventions
4. 8:04Epidemic Model
5. 10:30Literature
6. 13:17Approximate Dynamic Programming
7. 17:38Curing Resources
8. 20:34Cut Width
9. 21:44Cut Width Theorem
10. 31:24Questions

" related talks

• 01h 41mEpidemics 3Tom Britton · Graph Limits and Processes on Networks: From Epidemics to Misinformation Boot Camp
• 49mAn Algorithmic Theory of Brain NetworksNancy Lynch · Computational Theories of the Brain 2018
• 01h 32mNetworks and Economics 4Ben Golub · Graph Limits and Processes on Networks: From Epidemics to Misinformation Boot Camp
• 01h 08mSelf-stabilizing Population ProtocolsJanna Burman · Hydra 2022
• 33mA New Model for Ant Trail Formation and its Convergence PropertiesMoses Charikar, Shivam Garg, Deborah M. Gordon, Kirankumar Shiragur · ITCS 2021
• 47mSignal, if you can’t (for the damage)Ran Gelles · Advances in the Theory of Error-Correcting Codes
• 29mDecentralized Signal Control for Urban Road NetworksNeil Walton · Societal Networks 2018
• 46mTiming Matters: Online Dynamics in Broadcast GamesShuchi Chawla · Learning, Algorithm Design and Beyond Worst-Case Analysis