Lecture
Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.
This lecture covers the Laplacian flow and consensus on communication networks with a globally reachable node, illustrated through examples. It delves into the analysis of x = -Lx, equilibria, and theorems related to achieving consensus in networked control systems.