Related papers: On sampling diluted Spin Glasses using Glauber dyn…

Spin-glasses are natural Gibbs distributions that have been studied in Theoretical CS for many decades. Recently, they have been gaining attention from the community as they emerge naturally in neural computation and learning, network…

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…

We present a simple combinatorial framework for establishing approximate tensorization of variance and entropy in the setting of spin systems (a.k.a. undirected graphical models) based on balanced separators of the underlying graph. Such…

We introduce efficient algorithms for approximate sampling from symmetric Gibbs distributions on the sparse random (hyper)graph. The examples we consider include (but are not restricted to) important distributions on spin systems and…

We study Glauber dynamics for sampling from discrete distributions $\mu$ on the hypercube $\{\pm 1\}^n$. Recently, techniques based on spectral independence have successfully yielded optimal $O(n)$ relaxation times for a host of different…

We show that Glauber dynamics for $ p$-spin glass mixes exponentially slowly at inverse temperatures larger than a constant times $ \ln (p)/p $ for large enough $ p $. This is done by analyzing the energy landscape using Gaussian…

A sampling algorithm is presented that generates spin glass configurations of the 2D Edwards-Anderson Ising spin glass at finite temperature, with probabilities proportional to their Boltzmann weights. Such an algorithm overcomes the slow…

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…

For distributions over discrete product spaces $\prod_{i=1}^n \Omega_i'$, Glauber dynamics is a Markov chain that at each step, resamples a random coordinate conditioned on the other coordinates. We show that $k$-Glauber dynamics, which…

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

We revisit the Haake-Lewenstein-Wilkens (HLW) approach to Edwards-Anderson (EA) model of Ising spin glass [Phys. Rev. Lett. 55, 2606 (1985)]. This approach consists in evaluation and analysis of the probability distribution of…

We consider the Sherrington-Kirkpatrick model of spin glasses at high-temperature and no external field, and study the problem of sampling from the Gibbs distribution $\mu$ in polynomial time. We prove that, for any inverse temperature…

We study the mixing properties of the single-site Markov chain known as the Glauber dynamics for sampling $k$-colorings of a sparse random graph $G(n,d/n)$ for constant $d$. The best known rapid mixing results for general graphs are in…

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

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…

A feedback vertex set (FVS) of an undirected graph contains vertices from every cycle of this graph. Constructing a FVS of sufficiently small cardinality is very difficult in the worst cases, but for random graphs this problem can be…

We present a mean field model for spin glasses with a natural notion of distance built in, namely, the Edwards-Anderson model on the diluted D-dimensional unit hypercube in the limit of large D. We show that finite D effects are strongly…

We consider the Ising, and more generally, $q$-state Potts Glauber dynamics on random $d$-regular graphs on $n$ vertices at low temperatures $\beta \gtrsim \frac{\log d}{d}$. The mixing time is exponential in $n$ due to a bottleneck between…

We devise a deterministic algorithm to efficiently sample high-quality solutions of certain spin-glass systems that encode hard optimization problems. We employ tensor networks to represent the Gibbs distribution of all possible…

Spin-glasses are universal models that can capture complex behavior of many-body systems at the interface of statistical physics and computer science including discrete optimization, inference in graphical models, and automated reasoning.…