The random-cluster model is parametrized by an edge probability $p \in (0,1) and a cluster weight $q > 0$ We establish that for every $q\ge 1$ the random-Cluster Glauber dynamics mixes in optimal$\Theta(n\log n)$ steps on $n$-vertex random graphs having a prescribed degreesequence with bounded average branching $pAuthor(s) : Antonio Blanca, Reza Gheissari

Links : PDF - Abstract

Code :
Coursera

Keywords : random - dynamics - cluster - potts - graphs -

Leave a Reply

Your email address will not be published. Required fields are marked *