Related papers: Phase Coexistence and Slow Mixing for the Hard-Cor…
The hard-core model has attracted much attention across several disciplines, representing lattice gases in statistical physics and independent sets in discrete mathematics and computer science. On finite graphs, we are given a parameter…
Recoverable systems provide coarse models of data storage on the two-dimensional square lattice, where each site reconstructs its value from neighboring sites according to a specified local rule. To study the typical behavior of recoverable…
Gibbs sampling is a common procedure used to fit finite mixture models. However, it is known to be slow to converge when exploring correlated regions of a parameter space and so blocking correlated parameters is sometimes implemented in…
The hard core model in statistical physics is a probability distribution on independent sets in a graph in which the weight of any independent set I is proportional to lambda^(|I|), where lambda > 0 is the vertex activity. We show that…
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…
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…
Let $\gS=(V,E)$ be a finite, $d$-regular bipartite graph. For any $\lambda>0$ let $\pi_\lambda$ be the probability measure on the independent sets of $\gS$ in which the set $I$ is chosen with probability proportional to $\lambda^{|I|}$…
We formulate a continuous version of the well known discrete hardcore (or independent set) model on a locally finite graph, parameterized by the so-called activity parameter $\lambda > 0$. In this version, the state or "spin value" $x_u$ of…
In this article, we derive a sharp mixing time estimate of the Glauber dynamics for the Curie-Weiss-Potts model in the low-temperature regime. In contrast to the high-temperature regime studied by Cuff et al. (J. Stat. Phys. 149: 432-477,…
We perform a rigorous study of the Gibbs statistics of high-density hard-core random configurations on a unit triangular lattice $\mathbb{A}_2$ and a unit honeycomb graph $\mathbb{H}_2$, for any value of the (Euclidean) repulsion diameter…
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…
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 consider a countable system of interacting (possibly non-Markovian) stochastic differential equations driven by independent Brownian motions and indexed by the vertices of a locally finite graph $G = (V,E)$. The drift of the process at…
We study the performance of Markov chains for the $q$-state ferromagnetic Potts model on random regular graphs. It is conjectured that their performance is dictated by metastability phenomena, i.e., the presence of "phases" (clusters) in…
We show that for all sufficiently large d, the uniform proper 3-coloring model (in physics called the 3-state antiferromagnetic Potts model at zero temperature) on Z^d admits multiple maximal-entropy Gibbs measures. This is a consequence of…
The hardcore model is a fundamental probabilistic model extensively studied in statistical physics, probability theory, and computer science. For graphs of maximum degree $\Delta$, a well-known computational phase transition occurs at the…
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 consider polynomial long-range Ising models in one dimension, with ferromagnetic pair interactions decaying with power $2-\alpha$ (for $0 \leq \alpha < 1$), and prepared with randomly chosen boundary conditions. We show that at low…
The hard-core model has as its configurations the independent sets of some graph instance $G$. The probability distribution on independent sets is controlled by a `fugacity' $\lambda>0$, with higher $\lambda$ leading to denser…
Restricted Boltzmann Machines are a class of undirected graphical models that play a key role in deep learning and unsupervised learning. In this study, we prove a phase transition phenomenon in the mixing time of the Gibbs sampler for a…