The Critical Mean-field Chayes-Machta Dynamics

02/05/2021
by   Antonio Blanca, et al.
0

The random-cluster model is a unifying framework for studying random graphs, spin systems and electrical networks that plays a fundamental role in designing efficient Markov Chain Monte Carlo (MCMC) sampling algorithms for the classical ferromagnetic Ising and Potts models. In this paper, we study a natural non-local Markov chain known as the Chayes-Machta dynamics for the mean-field case of the random-cluster model, where the underlying graph is the complete graph on n vertices. The random-cluster model is parametrized by an it edge probability p and a cluster weight q. Our focus is on the critical regime: p = p_c(q) and q ∈ (1,2), where p_c(q) is the threshold corresponding to the order-disorder phase transition of the model. We show that the mixing time of the Chayes-Machta dynamics is O(log n ·loglog n) in this parameter regime, which reveals that the dynamics does not undergo an exponential slowdown at criticality, a surprising fact that had been predicted (but not proved) by statistical physicists. This also provides a nearly optimal bound (up to the loglog n factor) for the mixing time of the mean-field Chayes-Machta dynamics in the only regime of parameters where no non-trivial bound was previously known. Our proof consists of a multi-phased coupling argument that combines several key ingredients, including a new local limit theorem, a precise bound on the maximum of symmetric random walks with varying step sizes, and tailored estimates for critical random graphs. In addition, we derive an improved comparison inequality between the mixing time of the Chayes-Machta dynamics and that of the local Glauber dynamics on general graphs; this results in better mixing time bounds for the local dynamics in the mean-field setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2021

Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics

We consider the problem of sampling from the ferromagnetic Potts and ran...
research
08/28/2022

Metastable Mixing of Markov Chains: Efficiently Sampling Low Temperature Exponential Random Graphs

In this paper we consider the problem of sampling from the low-temperatu...
research
12/26/2021

Mallows permutation models with L^1 and L^2 distances I: hit and run algorithms and mixing times

Mallows permutation model, introduced by Mallows in statistical ranking ...
research
12/10/2020

Detecting Structured Signals in Ising Models

In this paper, we study the effect of dependence on detecting a class of...
research
02/17/2018

Optimal Single Sample Tests for Structured versus Unstructured Network Data

We study the problem of testing, using only a single sample, between mea...
research
05/22/2023

Sampling from the random cluster model on random regular graphs at all temperatures via Glauber dynamics

We consider the performance of Glauber dynamics for the random cluster m...
research
07/28/2016

Variational perturbation and extended Plefka approaches to dynamics on random networks: the case of the kinetic Ising model

We describe and analyze some novel approaches for studying the dynamics ...

Please sign up or login with your details

Forgot password? Click here to reset