Related papers: Sampling from the random cluster model on random r…
Sampling from Gibbs distribution is a central problem in computer science as well as in statistical physics. In this work we focus on the k-colouring model} and the hard-core model with fugacity \lambda when the underlying graph is an…
We present an improved coupling technique for analyzing the mixing time of Markov chains. Using our technique, we simplify and extend previous results for sampling colorings and independent sets. Our approach uses properties of the…
We consider a one-dimensional Ising model each of whose $N$ spins is in contact with two thermostats of distinct temperatures $T_1$ and $T_2$. Under Glauber dynamics the stationary state happens to coincide with the equilibrium state at an…
The exponential random graph model (ERGM) is a central object in the study of clustering properties in social networks as well as canonical ensembles in statistical physics. Despite some breakthrough works in the mathematical understanding…
We use Glauber dynamics to study frequency and temperature dependence of hysteresis loops in the pure (without quenched disorder) Ising model on cubic, square, honeycomb lattices and random graphs. Results are discussed in the context of…
This work is devoted to an in-depth analysis of arbitrary temperature protocols applied to the ferromagnetic Glauber-Ising chain launched from a disordered initial state and evolving in the low-temperature scaling regime. We focus our study…
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…
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…
We study the Glauber dynamics at zero temperature of spins placed on the vertices of an uncorrelated network with a power-law degreedistribution. Application of mean-field theory yields as main prediction that for symmetric disordered…
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…
The six-vertex model in statistical physics is a weighted generalization of the ice model on $\mathbb{Z}^2$ (i.e., Eulerian orientations) and the zero-temperature three-state Potts model (i.e., proper three-colorings). The phase diagram of…
We study the multi-component Ising model, which is also known as the block Ising model. In this model, the particles are partitioned into a fixed number of groups with a fixed proportion, and the interaction strength is determined by the…
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…
In this paper we investigate the relationship between the mixing times of the Glauber dynamics of a statistical mechanical system with its thermodynamic equilibrium structure. For this we consider the mean-field Blume-Capel model, one of…
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…
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…
We address the convergence rate of Markov chains for randomly generating an edge coloring of a given tree. Our focus is on the Glauber dynamics which updates the color at a randomly chosen edge in each step. For a tree $T$ with $n$ vertices…
We study the $q$-state ferromagnetic Potts model on the $n$-vertex complete graph known as the mean-field (Curie-Weiss) model. We analyze the Swendsen-Wang algorithm which is a Markov chain that utilizes the random cluster representation…
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…
We characterize the uniqueness condition in the hardcore model for bipartite graphs with degree bounds only on one side, and provide a nearly linear time sampling algorithm that works up to the uniqueness threshold. We show that the…