This lecture covers the theory and applications of graph coloring, focusing on disassortative stochastic block models and planted coloring. It discusses the challenges and strategies in graph coloring, including equilibrium sampling, Bayes optimal overlap, and undetectable phases.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace