Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture delves into advanced concepts of graph coloring, focusing on the implications of planted coloring and the relation between planted and random graph coloring. The instructor explains the rigidity threshold and the frozen variables in the context of BP fixed points. The lecture also covers the equilibrium properties of random ensembles and the clustering of solutions. Various conjectures and claims are discussed regarding the contiguous nature of planted coloring to random coloring and the behavior of BP in different scenarios.