English
Related papers

Related papers: Glauber dynamics for random field Ising models on …

200 papers

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

We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time (defined as…

Probability · Mathematics 2016-09-07 Noam Berger , Claire Kenyon , Elchanan Mossel , Yuval Peres

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

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

Consider random $d$-regular graphs, i.e., random graphs such that there are exactly $d$ edges from each vertex for some $d\ge 3$. We study both the configuration model version of this graph, which has occasional multi-edges and self-loops,…

Probability · Mathematics 2021-04-27 Van Hao Can , Remco van der Hofstad , Takashi Kumagai

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

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 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 consider the performance of Glauber dynamics for the random cluster model with real parameter $q>1$ and temperature $\beta>0$. Recent work by Helmuth, Jenssen and Perkins detailed the ordered/disordered transition of the model on random…

Probability · Mathematics 2025-04-30 Andreas Galanis , Leslie Ann Goldberg , Paulina Smolarova

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

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

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

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 study the Glauber dynamics of Ising spin models with random bonds, on finitely connected random graphs. We generalize a recent dynamical replica theory with which to predict the evolution of the joint spin-field distribution, to include…

Disordered Systems and Neural Networks · Physics 2015-05-13 A. Mozeika , A. C. C. Coolen

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

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

Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and it is widely believed that no polynomial-time approximation…

Data Structures and Algorithms · Computer Science 2021-08-27 Tyler Helmuth , Holden Lee , Will Perkins , Mohan Ravichandran , Qiang Wu

Given a graph $G$, the hard-core model defines a probability distribution over its independent sets, assigning to each set of size $k$ a probability of $\frac{\lambda^k}{Z}$, where $\lambda>0$ is a parameter known as the \emph{fugacity} and…

Data Structures and Algorithms · Computer Science 2025-11-24 Malory Marin
‹ Prev 1 2 3 10 Next ›