Abstract
We consider the random‐cluster model (RCM) onwith parametersp∈(0,1) andq ≥ 1. This is a generalization of the standard bond percolation (with edges open independently with probabilityp) which is biased by a factorqraised to the number of connected components. We study the well‐known Fortuin‐Kasteleyn (FK)‐dynamics on this model where the update at an edge depends on the global geometry of the system unlike the Glauber heat‐bath dynamics for spin systems, and prove that for all small enoughp(depending on the dimension) and anyq>1, the FK‐dynamics exhibits the cutoff phenomenon atwith a window size, whereλ∞is the largenlimit of the spectral gap of the process. Our proof extends theinformation percolationframework of Lubetzky and Sly to the RCM and also relies on the arguments of Blanca and Sinclair who proved a sharpmixing time bound for the planar version. A key aspect of our proof is the analysis of the effect of a sequence of dependent (across time) Bernoulli percolations extracted from the graphical construction of the dynamics, on how information propagates.
Funding Information
  • National Research Foundation of Korea (2018R1C1B6006896, 2017R1A5A1015626)

This publication has 27 references indexed in Scilit: