English
Related papers

Related papers: Mixing time for the Ising model: a uniform lower b…

200 papers

We prove that any Markov chain that performs local, reversible updates on randomly chosen vertices of a bounded-degree graph necessarily has mixing time at least $\Omega(n\log n)$, where $n$ is the number of vertices. Our bound applies to…

Probability · Mathematics 2009-09-29 Thomas P. Hayes , Alistair Sinclair

We prove an optimal $O(n \log n)$ mixing time of the Glauber dynamics for the Ising models with edge activity $\beta \in \left(\frac{\Delta-2}{\Delta}, \frac{\Delta}{\Delta-2}\right)$. This mixing time bound holds even if the maximum degree…

Probability · Mathematics 2021-11-05 Xiaoyu Chen , Weiming Feng , Yitong Yin , Xinyuan Zhang

We prove an optimal $\Omega(n^{-1})$ lower bound on the spectral gap of Glauber dynamics for anti-ferromagnetic two-spin systems with $n$ vertices in the tree uniqueness regime. This spectral gap holds for all, including unbounded, maximum…

Data Structures and Algorithms · Computer Science 2021-11-22 Xiaoyu Chen , Weiming Feng , Yitong Yin , Xinyuan Zhang

We study the mixing time of systematic scan Glauber dynamics Ising model on the complete graph. On the complete graph $K_n$, at each time, $k \leq n$ vertices are chosen uniformly random and are updated one by one according to the uniformly…

Probability · Mathematics 2024-11-11 Sanghak Jeon

Over the past decades, a fascinating computational phase transition has been identified in sampling from Gibbs distributions. Though, the computational complexity at the critical point remains poorly understood, as previous algorithmic and…

Data Structures and Algorithms · Computer Science 2026-01-08 Xiaoyu Chen , Zongchen Chen , Yitong Yin , Xinyuan Zhang

We present several results on the mixing time of the Glauber dynamics for sampling from the Gibbs distribution in the ferromagnetic Potts model. At a fixed temperature and interaction strength, we study the interplay between the maximum…

Discrete Mathematics · Computer Science 2014-06-06 Magnus Bordewich , Catherine Greenhill , Viresh Patel

We prove an optimal mixing time bound on the single-site update Markov chain known as the Glauber dynamics or Gibbs sampling in a variety of settings. Our work presents an improved version of the spectral independence approach of Anari et…

Discrete Mathematics · Computer Science 2023-03-24 Zongchen Chen , Kuikui Liu , Eric Vigoda

We consider Glauber dynamics for the Ising model on the complete graph on $n$ vertices, known as the Curie-Weiss model. It is well-known that the mixing-time in the high temperature regime ($\beta < 1$) has order $n\log n$, whereas the…

Probability · Mathematics 2009-11-13 Jian Ding , Eyal Lubetzky , Yuval Peres

We study the stochastic Ising model on finite graphs with n vertices and bounded degree and analyze the effect of boundary conditions on the mixing time. We show that for all low enough temperatures, the spectral gap of the dynamics with…

Probability · Mathematics 2008-11-10 Alessandra Bianchi

We prove that the the mixing time of the Glauber dynamics for sampling independent sets on $n$-vertex $k$-uniform hypergraphs is $O(n\log n)$ when the maximum degree $\Delta$ satisfies $\Delta \leq c 2^{k/2}$, improving on the previous…

Probability · Mathematics 2019-12-25 Jonathan Hermon , Allan Sly , Yumeng Zhang

We study Glauber dynamics for the Ising model on the complete graph on $n$ vertices, known as the Curie-Weiss Model. It is well known that at high temperature ($\beta < 1$) the mixing time is $\Theta(n\log n)$, whereas at low temperature…

Probability · Mathematics 2015-05-13 Jian Ding , Eyal Lubetzky , Yuval Peres

We study the Glauber dynamics for the Ising model on the complete graph, also known as the Curie-Weiss Model. For beta < 1, we prove that the dynamics exhibits a cut-off: the distance to stationarity drops from near 1 to near 0 in a window…

Probability · Mathematics 2007-12-11 David A. Levin , Malwina J. Luczak , Yuval Peres

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

It is well known that Glauber dynamics on spin systems typically suffer exponential slowdowns at low temperatures. This is due to the emergence of multiple metastable phases in the state space, separated by narrow bottlenecks that are hard…

Probability · Mathematics 2024-12-24 Reza Gheissari , Alistair Sinclair

We establish tight results for rapid mixing of Gibbs samplers for the Ferromagnetic Ising model on general graphs. We show that if \[(d-1)\tanh\beta<1,\] then there exists a constant C such that the discrete time mixing time of Gibbs…

Probability · Mathematics 2013-02-06 Elchanan Mossel , Allan Sly

We present improved bounds for randomly sampling $k$-colorings of graphs with maximum degree $\Delta$; our results hold without any further assumptions on the graph. The Glauber dynamics is a simple single-site update Markov chain. Jerrum…

Discrete Mathematics · Computer Science 2024-11-01 Charlie Carlson , Eric Vigoda

We study the single-site Glauber dynamics for the fugacity $\lambda$, Hard-core model on the random graph $G(n, d/n)$. We show that for the typical instances of the random graph $G(n,d/n)$ and for fugacity $\lambda <…

Discrete Mathematics · Computer Science 2023-02-14 Charilaos Efthymiou , Weiming Feng

We give the first comprehensive analysis of the effect of boundary conditions on the mixing time of the Glauber dynamics in the so-called Bethe approximation. Specifically, we show that spectral gap and the log-Sobolev constant of the…

Probability · Mathematics 2009-11-10 Fabio Martinelli , Alistair Sinclair , Dror Weitz

We study the mixing time of Glauber dynamics on monotone systems. For monotone systems satisfying the entropic independence condition, we prove a new mixing time comparison result for Glauber dynamics. For concrete applications, we obtain…

Discrete Mathematics · Computer Science 2025-07-16 Weiming Feng , Minji Yang

We consider Metropolis Glauber dynamics for sampling proper $q$-colourings of the $n$-vertex complete $b$-ary tree when $3\leq q\leq b/2\ln(b)$. We give both upper and lower bounds on the mixing time. For fixed $q$ and $b$, our upper bound…

Computational Complexity · Computer Science 2008-06-06 Leslie Ann Goldberg , Mark Jerrum , Marek Karpinski
‹ Prev 1 2 3 10 Next ›