Lectures related to Information Theory: Basics

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

Covers the computation of Bethe free entropy and the interpretation of messages between variables and factors.

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

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

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

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

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.

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

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

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

Covers the fundamentals of Markov chains and their applications in algorithms, focusing on proper coloring and the Metropolis algorithm.

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

Explores advanced graph coloring concepts, including planted coloring, rigidity threshold, and frozen variables in BP fixed points.

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

Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.

Covers graphical models for probability distributions and factor graphs representation.

Explores graph coloring, directed cycles, LLL algorithm applications, and element dependencies in graphs.

Covers the concept of graph sketching with a focus on connected components.

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