Related papers: Approximating the partition function of the ferrom…
We perform Monte Carlo simulations using the Wolff cluster algorithm of the q=2 (Ising), 3, 4 and q=10 Potts models on dynamical phi-cubed graphs of spherical topology with up to 5000 nodes. We find that the measured critical exponents are…
We introduce and study the computational problem of determining statistical similarity between probability distributions. For distributions $P$ and $Q$ over a finite sample space, their statistical similarity is defined as…
We study the complexity of approximating the partition function of dense Ising models in the critical regime. Recent work of Chen, Chen, Yin, and Zhang (FOCS 2025) established fast mixing at criticality, and even beyond criticality in a…
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
We construct the exact partition function of the Potts model on a complete graph subject to external fields with linear and nematic type couplings. The partition function is obtained as a solution to a linear diffusion equation and the free…
We prove that, unless P=NP, there is no polynomial-time algorithm to approximate within some multiplicative constant the average size of an independent set in graphs of maximum degree 6. This is a special case of a more general result for…
The problem of (approximately) counting the independent sets of a bipartite graph (#BIS) is the canonical approximate counting problem that is complete in the intermediate complexity class #RH\Pi_1. It is believed that #BIS does not have an…
We develop an efficient algorithmic approach for approximate counting and sampling in the low-temperature regime of a broad class of statistical physics models on finite subsets of the lattice $\mathbb Z^d$ and on the torus $(\mathbb Z/n…
We show that it is $\mathsf{NP}$-hard to approximate the hyperspherical radius of a triangulated manifold up to an almost-polynomial factor.
Potts models, which can be used to analyze dependent observations on a lattice, have seen widespread application in a variety of areas, including statistical mechanics, neuroscience, and quantum computing. To address the intractability of…
We apply the Hierarchical Autoregressive Neural (HAN) network sampling algorithm to the two-dimensional $Q$-state Potts model and perform simulations around the phase transition at $Q=12$. We quantify the performance of the approach in the…
Many promising applications of quantum computing with a provable speedup center around the HHL algorithm. Due to restrictions on the hardware and its significant demand on qubits and gates in known implementations, its execution is…
Since the grand partition function $Z_q$ for the so-called $q$-particles (i.e.,\ quons), $q\in(-1,1)$, cannot be computed by using the standard 2nd quantisation technique involving the full Fock space construction for $q=0$, and its…
The aim of this short note is to draw attention to a method by which the partition function and marginal probabilities for a certain class of random fields on complete graphs can be computed in polynomial time. This class includes Ising…
We consider the problem of approximating two, possibly unrelated probability distributions from a single complex-valued function $\psi$ and its Fourier transform. We show that this problem always has a solution within a specified degree of…
We study the relationship between Q-state Potts models and staggered RSOS models of the A\_{p-1} type on a torus, with sqrt(Q)=2 cos(pi / p). In general the partition functions of these models differ due to clusters of non-trivial topology.…
Normal factor graph duality offers new possibilities for Monte Carlo algorithms in graphical models. Specifically, we consider the problem of estimating the partition function of the ferromagnetic Ising and Potts models by Monte Carlo…
The paper presents complexity results and performance guaranties for a family of approximation algorithms for an optimisation problem arising in software testing and manufacturing. The problem is formulated as a partitioning of a set where…
We study complex CFTs describing fixed points of the two-dimensional $Q$-state Potts model with $Q>4$. Their existence is closely related to the weak first-order phase transition and walking RG behavior present in the real Potts model at…
We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…