Lectures related to Mean field computation

Covers exercises on the spin model, independent set, matching, and increasing functions.

Explores the optimality of the greedy change-making algorithm and the stability of maximum matching.

Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.

Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Covers the concept of stable matchings and the Gale-Shapley algorithm.

Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.

Explains message passing in graphical models and the matching problem in graph theory.

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

Explores the relationship between matchings, entropy, and Bethe free entropy in random graphs.