Information percolation and cutoff for the random-cluster model
From MaRDI portal
(Redirected from Publication:5136933)
Abstract: We consider the Random-Cluster model on with parameters and . This is a generalization of the standard bond percolation (with open probability ) which is biased by a factor raised to the number of connected components. We study the well known 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 enough (depending on the dimension) and any , the FK-dynamics exhibits the cutoff phenomenon at with a window size , where is the large limit of the spectral gap of the process. Our proof extends the Information Percolation framework of Lubetzky and Sly [21] to the Random-Cluster model and also relies on the arguments of Blanca and Sinclair [4] who proved a sharp mixing 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.
Recommendations
- Random-cluster dynamics in \(\mathbb{Z}^2\)
- Random-cluster dynamics in \(\mathbb {Z}^2\)
- Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
- Quasi-polynomial mixing of critical two-dimensional random cluster models
- Dynamics for the mean-field random-cluster model
Cited in
(11)- Random-cluster dynamics on random regular graphs in tree uniqueness
- Random-cluster dynamics in \(\mathbb{Z}^2\): rapid mixing with general boundary conditions
- scientific article; zbMATH DE number 6318810 (Why is no real title available?)
- Information content of cluster–period cells in stepped wedge trials
- scientific article; zbMATH DE number 7650134 (Why is no real title available?)
- An exposition to information percolation for the Ising model
- Spatial mixing and the random‐cluster dynamics on lattices
- Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics
- Cutoff for non-negatively curved Markov chains
- The \(S_k\) shuffle block dynamics
- Reprint of: ``Information percolation in segmented markets
This page was built for publication: Information percolation and cutoff for the random-cluster model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136933)