English
Related papers

Related papers: Systematic scanning Glauber dynamics for the mean-…

200 papers

We prove that Ising models on the hypercube with general quadratic interactions satisfy a Poincar\'{e} inequality with respect to the natural Dirichlet form corresponding to Glauber dynamics, as soon as the operator norm of the interaction…

Probability · Mathematics 2021-08-10 Ronen Eldan , Frederic Koehler , Ofer Zeitouni

The Glauber dynamics on the colourings of a graph is a random process which consists in recolouring at each step a random vertex of a graph with a new colour chosen uniformly at random among the colours not already present in its…

Combinatorics · Mathematics 2020-11-04 Marc Heinrich

We study the mixing time of Glauber dynamics for Ising models in which the interaction matrix contains a single negative spectral outlier. This class includes the anti-ferromagnetic Curie-Weiss model, the anti-ferromagnetic Ising model on…

Probability · Mathematics 2026-04-09 Dan Mikulincer , Youngtak Sohn

In this note, we prove that on any graph of maximal degree $d$ the mixing time of the Glauber Dynamics for the Ising Model at $\beta_c=\tanh^{-1}(\frac1{d-1})$, the uniqueness threshold on the infinite $d$-regular tree, is at most…

Probability · Mathematics 2024-11-18 Kyprianos-Iason Prodromidis , Allan Sly

We study the mixing time of systematic scan Markov chains on finite spin systems. It is known that, in a single site setting, the mixing time of systematic scan can be bounded in terms of the influences sites have on each other. We…

Probability · Mathematics 2007-06-12 Kasper Pedersen

We introduce a general class of mean-field-like spin systems with random couplings that comprises both the Ising model on inhomogeneous dense random graphs and the randomly diluted Hopfield model. We are interested in quantitative estimates…

Probability · Mathematics 2024-07-10 Anton Bovier , Frank den Hollander , Saeda Marello , Elena Pulvirenti , Martin Slowik

The hard-core model has as its configurations the independent sets of some graph instance $G$. The probability distribution on independent sets is controlled by a `fugacity' $\lambda>0$, with higher $\lambda$ leading to denser…

Probability · Mathematics 2026-01-14 Mark Jerrum

Finding a ground state of a given Hamiltonian of an Ising model on a graph $G=(V,E)$ is an important but hard problem. The standard approach for this kind of problem is the application of algorithms that rely on single-spin-flip Markov…

We consider Glauber dynamics for the low-temperature, ferromagnetic Ising Model set on the n-dimensional hypercube. We derive precise asymptotic results for the crossover time (the time it takes for the dynamics to go from the configuration…

Probability · Mathematics 2015-09-01 Oliver Jovanovski

In this article, we derive a sharp mixing time estimate of the Glauber dynamics for the Curie-Weiss-Potts model in the low-temperature regime. In contrast to the high-temperature regime studied by Cuff et al. (J. Stat. Phys. 149: 432-477,…

Probability · Mathematics 2026-02-24 Seonwoo Kim , Jungkyoung Lee

The hardcore model is a fundamental probabilistic model extensively studied in statistical physics, probability theory, and computer science. For graphs of maximum degree $\Delta$, a well-known computational phase transition occurs at the…

Data Structures and Algorithms · Computer Science 2025-11-13 Xiaoyu Chen , Zejia Chen , Zongchen Chen , Yitong Yin , Xinyuan Zhang

We study the speed of convergence of the Swendsen-Wang (SW) dynamics for the $q$-state ferromagnetic Potts model on the $n$-vertex complete graph, known as the mean-field model. The SW dynamics was introduced as an attractive alternative to…

Probability · Mathematics 2025-10-14 Antonio Blanca , Zhezheng Song

The Glauber dynamics for the classical $2$-spin Curie-Weiss model on $N$ nodes with inverse temperature $\beta$ and zero external field is known to mix in time $\Theta(N\log N)$ for $\beta < \frac{1}{2}$, in time $\Theta(N^{3/2})$ at $\beta…

Probability · Mathematics 2025-02-21 Ramkrishna Jyoti Samanta , Somabha Mukherjee , Jiang Zhang

We develop a new framework to prove the mixing or relaxation time for the Glauber dynamics on spin systems with unbounded degree. It works for general spin systems including both $2$-spin and multi-spin systems. As applications for this…

Data Structures and Algorithms · Computer Science 2024-07-08 Xiaoyu Chen , Weiming Feng

The random-cluster model has been widely studied as a unifying framework for random graphs, spin systems and electrical networks, but its dynamics have so far largely resisted analysis. In this paper we analyze the Glauber dynamics of the…

Discrete Mathematics · Computer Science 2022-05-10 Antonio Blanca , Alistair Sinclair

We give a survey of the known results on mixing time of Glauber dynamics for the Ising model on the square lattice and present a technique that makes exact sampling of the Ising model at all temperatures possible in polynomial time. At high…

Probability · Mathematics 2014-04-23 Mario Ullrich

We address the problem of sampling colorings of a graph $G$ by Markov chain simulation. For most of the article we restrict attention to proper $q$-colorings of a path on $n$ vertices (in statistical physics terms, the one-dimensional…

Probability · Mathematics 2007-05-23 Martin Dyer , Leslie Ann Goldberg , Mark Jerrum

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of $k$-colorings of a graph $G$ on $n$ vertices with maximum degree $\Delta$ is rapidly mixing for $k\ge\Delta+2$. In FOCS 1999, Vigoda…

Data Structures and Algorithms · Computer Science 2018-11-01 Sitan Chen , Michelle Delcourt , Ankur Moitra , Guillem Perarnau , Luke Postle

We investigate the effect of disorder on the Curie-Weiss model with Glauber dynamics. In particular, we study metastability for spin-flip dynamics on the Erd\H{o}s-R\'enyi random graph $ER_n(p)$ with $n$ vertices and with edge retention…

Probability · Mathematics 2020-07-24 Frank den Hollander , Oliver Jovanovski

Spin-glasses are Gibbs distributions that have been studied in CS for many decades. Recently, they have gained renewed attention as they emerge naturally in learning, inference, optimisation etc. We consider the Edwards-Anderson (EA)…

Discrete Mathematics · Computer Science 2024-03-15 Charilaos Efthymiou , Kostas Zampetakis