Lectures related to Statistical analysis of network data

Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.

Explores coordination in networked control systems, graph theory, and consensus algorithms.

Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

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

Explores fundamental graph theory concepts, Erdős' results, Chromatic Lemma, and Union Bound theorem in graph theory.

Covers the definition of flow in a network and flow calculation.

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Explores interlacing families, Ramanujan graphs, and their construction using signed adjacency matrices.