English
Related papers

Related papers: Fast mixing in Ising models with a negative spectr…

200 papers

We study the ferromagnetic random field Ising model (RFIM) on a graph $G=(V,E)$ having maximal degree $\Delta$, where the external field at each vertex is an i.i.d. random variable. When the random field distribution is sufficiently…

Probability · Mathematics 2026-05-05 Yi Han

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 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

We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length $\gamma$. Recent work in this setting has shown various algorithmic results that apply…

Data Structures and Algorithms · Computer Science 2024-07-11 Andreas Galanis , Alkis Kalavasis , Anthimos Vardis Kandiros

We study the convergence properties of Glauber dynamics for the random field Ising model (RFIM) with ferromagnetic interactions on finite domains of $\mathbb{Z}^d$, $d \ge 2$. Of particular interest is the Griffiths phase where correlations…

Probability · Mathematics 2024-11-14 Ahmed El Alaoui , Ronen Eldan , Reza Gheissari , Arianna Piana

We consider Ising models on the hypercube with a general interaction matrix $J$, and give a polynomial time sampling algorithm when all but $O(1)$ eigenvalues of $J$ lie in an interval of length one, a situation which occurs in many models…

Data Structures and Algorithms · Computer Science 2022-02-21 Frederic Koehler , Holden Lee , Andrej Risteski

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 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 present novel results for fast mixing of Glauber dynamics using the newly introduced and powerful Spectral Independence method from [Anari, Liu, Oveis-Gharan: FOCS 2020]. We mainly focus on the Hard-core model and the Ising model. We…

Discrete Mathematics · Computer Science 2025-04-29 Charilaos Efthymiou

Consider Glauber dynamics for the Ising model on a graph of $n$ vertices. Hayes and Sinclair showed that the mixing time for this dynamics is at least $n\log n/f(\Delta)$, where $\Delta$ is the maximum degree and $f(\Delta) = \Theta(\Delta…

Probability · Mathematics 2013-09-26 Jian Ding , Yuval Peres

We give a near-linear time sampler for the Gibbs distribution of the ferromagnetic Ising models with edge activities $\boldsymbol{\beta} > 1$ and external fields $\boldsymbol{\lambda}<1$ (or symmetrically, $\boldsymbol{\lambda}>1$) on…

Probability · Mathematics 2023-08-21 Xiaoyu Chen , Xinyuan Zhang

Recently, Eldan, Koehler, and Zeitouni (2020) showed that Glauber dynamics mixes rapidly for general Ising models so long as the difference between the largest and smallest eigenvalues of the coupling matrix is at most $1 - \epsilon$ for…

Data Structures and Algorithms · Computer Science 2023-12-01 Dmitriy Kunisky

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

Motivated by the community detection problem in Bayesian inference, as well as the recent explosion of interest in spin glasses from statistical physics, we study the classical Glauber dynamics for sampling from Ising models with sparse…

Probability · Mathematics 2024-08-07 Kuikui Liu , Sidhanth Mohanty , Amit Rajaraman , David X. Wu

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

Motivated by the `subgraphs world' view of the ferromagnetic Ising model, we develop a general approach to studying mixing times of Glauber dynamics based on subset expansion expressions for a class of graph polynomials. With a canonical…

Combinatorics · Mathematics 2015-10-29 Magnus Bordewich , Ross J. Kang

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 study the sampling problem for the ferromagnetic Ising model with consistent external fields, and in particular, Swendsen-Wang dynamics on this model. We introduce a new grand model unifying two closely related models: the subgraph world…

Data Structures and Algorithms · Computer Science 2022-07-19 Weiming Feng , Heng Guo , Jiaheng Wang

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
‹ Prev 1 2 3 10 Next ›