Video URL

https://old.simons.berkeley.edu/node/22587

Random Cluster Model on Regular Graphs

(2022). Random Cluster Model on Regular Graphs. The Simons Institute for the Theory of Computing. https://old.simons.berkeley.edu/node/22587

Random Cluster Model on Regular Graphs. The Simons Institute for the Theory of Computing, Sep. 26, 2022, https://old.simons.berkeley.edu/node/22587 

          @misc{ scivideos_22587,
            doi = {},
            url = {https://old.simons.berkeley.edu/node/22587},
            author = {},
            keywords = {},
            language = {en},
            title = {Random Cluster Model on Regular Graphs},
            publisher = {The Simons Institute for the Theory of Computing},
            year = {2022},
            month = {sep},
            note = {22587 see, \url{https://scivideos.org/simons-institute/22587}}
          }
Péter Csikvári (Eötvös Loránd University)
Source Repository Simons Institute
Subject

Abstract

Abstract   In this talk we study the random cluster model on essentially large girth and random regular graphs. We give explicit formula for the limiting free entropy of the random cluster model. Our result  extends the work of Dembo, Montanari, Sly and Sun for the Potts model, and we prove a conjecture of Helmuth, Jenssen and Perkins about the phase transition of the random cluster model. This is joint work with Ferenc Bencs and Márton Borbényi.