Lectures related to Networked Control Systems: Laplacian Operators and Microgrids

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Explores the properties and applications of Cayley graphs in group theory and network analysis.

Explores model selection challenges in causal models and the impact of local geometry on statistical inference.

Explores the Laplacian matrix properties and consensus in continuous time.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Explores causal inference through learning graph structures for causal reasoning from observational data.

Explores finding the equation of the tangent line to a function's graph at a point.

Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.