Lecture
This lecture covers the design of graph weights to ensure consensus in networked control systems, including the Metropolis-Hasting model and the computation of weighted adjacency matrices. It also explores applications of consensus algorithms such as BLUE estimation in sensor networks and node counting.