Related papers: Algorithm for computing the partition function of …
Given a vertex-weighted graph $G=(V,E)$ and a set $S \subseteq V$, a subset feedback vertex set $X$ is a set of the vertices of $G$ such that the graph induced by $V \setminus X$ has no cycle containing a vertex of $S$. The \textsc{Subset…
In this paper we consider the algorithmic problem of sampling from the Potts model and computing its partition function at low temperatures. Instead of directly working with spin configurations, we consider the equivalent problem of…
We present exact calculations of the Potts model partition function Z(G,q,v) for arbitrary q and temperature-like variable v on n-vertex strip graphs G of the triangular lattice for a variety of transverse widths equal to L vertices and for…
We present exact calculations of the Potts model partition function $Z(G,q,v)$ for arbitrary $q$ and temperature-like variable $v$ on $n$-vertex strip graphs $G$ of the honeycomb lattice for a variety of transverse widths equal to $L_y$…
Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and…
We review some connections between quantum information and statistical mechanics. We focus on three sets of results for classical spin models. First, we show that the partition function of all classical spin models (including models in…
A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…
We determine the spaces of states of the two-dimensional $O(n)$ and $Q$-state Potts models with generic parameters $n,Q\in \mathbb{C}$ as representations of their known symmetry algebras. While the relevant representations of the conformal…
Recent results establish for 2-spin antiferromagnetic systems that the computational complexity of approximating the partition function on graphs of maximum degree D undergoes a phase transition that coincides with the uniqueness phase…
Sampling from the $q$-state ferromagnetic Potts model is a fundamental question in statistical physics, probability theory, and theoretical computer science. On general graphs, this problem may be computationally hard, and this hardness…
The partition function of a factor graph and the partition function of the dual factor graph are related to each other by the normal factor graph duality theorem. We apply this result to the classical problem of computing the partition…
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…
In this paper, we consider different constrained partition problems for weighted trees and cactus graphs. We focus on the (l,u)-partition problem, which is the problem of partitioning a weighted graph into connected clusters such that each…
We study the complexity of approximately evaluating the Ising and Tutte partition functions with complex parameters. Our results are partly motivated by the study of the quantum complexity classes BQP and IQP. Recent results show how to…
We relate a large class of classical spin models, including the inhomogeneous Ising, Potts, and clock models of q-state spins on arbitrary graphs, to problems in quantum physics. More precisely, we show how to express partition functions as…
We present an algorithm that takes as input a graph $G$ with weights on the vertices, and computes a maximum weight independent set $S$ of $G$. If the input graph $G$ excludes a path $P_k$ on $k$ vertices as an induced subgraph, the…
The importance-sampling Monte Carlo algorithm appears to be the universally optimal solution to the problem of sampling the state space of statistical mechanical systems according to the relative importance of configurations for the…
We give an FPTAS and an efficient sampling algorithm for the high-fugacity hard-core model on bounded-degree bipartite expander graphs and the low-temperature ferromagnetic Potts model on bounded-degree expander graphs. The results apply,…
We introduce a new subclass of chordal graphs that generalizes split graphs, which we call well-partitioned chordal graphs. Split graphs are graphs that admit a partition of the vertex set into cliques that can be arranged in a star…
The Tutte polynomial is originally a bivariate polynomial enumerating the colorings of a graph and of its dual graph. But it reveals more of the internal structure of the graph like its number of forests, of spanning subgraphs, and of…