Lecture
Markov Chains and Algorithm Applications
Related lectures (52)
Markov Chains: Applications and Analysis
Explores Markov chains, focusing on the coloring problem and algorithm analysis.
Markov Chains: Applications and Sampling Methods
Covers the basics of Markov chains and their algorithmic applications.
Graph Coloring: Random vs Symmetrical
Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.
Information Theory: Basics
Covers the basics of information theory, entropy, and fixed points in graph colorings and the Ising model.
Belief Propagation for Graph Coloring
Explores Belief Propagation for graph coloring and its convergence properties.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Graph Coloring: Theory and Applications
Covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring.
Belief Propagation
Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.
Graphical Models: Probability Distributions and Factor Graphs
Covers graphical models for probability distributions and factor graphs representation.
Markov Chains and Applications
Explores Markov chains, Ising Model, Metropolis algorithm, and Glauber dynamics.