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.
Lecture
Cluster Complexity Analysis
Description
This lecture delves into the analysis of cluster complexity in random graph coloring, discussing equilibrium clusters, entropy, and the transition to a glass state. It covers the quantitative description of clusters, free entropy, and the Bethe approximation method.
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 MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.