Related papers: On the tractability of sampling from the Potts mod…
We show that large deviation properties of Erd\"os-R\'enyi random graphs can be derived from the free energy of the $q$-state Potts model of statistical mechanics. More precisely the Legendre transform of the Potts free energy with respect…
Through a Metropolis-like algorithm with single step computational cost of order one, we build a Markov chain that relaxes to the canonical Fermi statistics for k non-interacting particles among m energy levels. Uniformly over the…
Sampling from combinatorial families can be difficult. However, complicated families can often be embedded within larger, simpler ones, for which easy sampling algorithms are known. We take advantage of such a relationship to describe a…
The random-cluster model is a dependent percolation model that has applications in the study of Ising and Potts models. In this paper, several new results are obtained for the random-cluster model on nonamenable graphs with cluster…
Several strategies have been recently proposed in order to improve Monte Carlo sampling efficiency using machine learning tools. Here, we challenge these methods by considering a class of problems that are known to be exponentially hard to…
For spin systems, such as the $q$-colorings and independent-set models, approximating the partition function in the so-called non-uniqueness region, where the model exhibits long-range correlations, is typically computationally hard for…
This paper studies the problem of detecting the presence of a small dense community planted in a large Erd\H{o}s-R\'enyi random graph $\mathcal{G}(N,q)$, where the edge probability within the community exceeds $q$ by a constant factor.…
We study the Swendsen-Wang dynamics for the $q$-state Potts model on the lattice. Introduced as an alternative algorithm of the classical single-site Glauber dynamics, the Swendsen-Wang dynamics is a non-local Markov chain that recolors…
The paper deals with a random connection model, a random graph whose vertices are given by a homogeneous Poisson point process on $\mathbb{R}^d$, and edges are independently drawn with probability depending on the locations of the two end…
We present exact calculations of the zero-temperature partition function (chromatic polynomial) and the (exponent of the) ground-state entropy $S_0$ for the $q$-state Potts antiferromagnet on families of cyclic and twisted cyclic (M\"obius)…
The random field q-States Potts model is investigated using exact groundstates and finite-temperature transfer matrix calculations. It is found that the domain structure and the Zeeman energy of the domains resembles for general q the…
The modeling of diffusion processes on graphs is the basis for many network science and machine learning approaches. Entropic measures of network-based diffusion have recently been employed to investigate the reversibility of these…
An important paradigm in the understanding of mixing times of Glauber dynamics for spin systems is the correspondence between spatial mixing properties of the models and bounds on the mixing time of the dynamics. This includes, in…
We consider the ferromagnetic q-state Potts model on a finite grid graph with non-zero external field and periodic boundary conditions. The system evolves according to Glauber-type dynamics described by the Metropolis algorithm, and we…
We study the Potts model on locally tree-like random graphs of arbitrary degree distribution. Using a population dynamics algorithm we numerically solve the problem exactly. We confirm our results with simulations. Comparisons with a…
Bayesian inference for undirected graphical models is mostly restricted to the class of decomposable graphs, as they enjoy a rich set of properties making them amenable to high-dimensional problems. While parameter inference is…
We investigate absorption, i.e., almost sure convergence to an absorbing state, in time-varying (non-homogeneous) discrete-time Markov chains with finite state space. We consider systems that can switch among a finite set of transition…
A method for reconstructing the energy landscape of simple polypeptidic chains is described. We show that we can construct an equivalent representation of the energy landscape by a suitable directed graph. Its topological and dynamical…
For any integers $d,q\ge 3$, we consider the $q$-state ferromagnetic Potts model with an external field on a sequence of expander graphs that converges to the $d$-regular tree $\mathtt{T}_d$ in the Benjamini-Schramm sense. We show that…
We present a new approach to a classical problem in statistical physics: estimating the partition function and other thermodynamic quantities of the ferromagnetic Ising model. Markov chain Monte Carlo methods for this problem have been…