Lectures related to Szemerédi Regularity Lemma

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

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

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

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

Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

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

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.

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

Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.

Explores the Cavity Method in Mean Field Theory, analyzing spins in an external field within a graph.

Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.

Explores Markov chains, focusing on the coloring problem and algorithm analysis.

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

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.