Subquadratic Counting via Perfect Marginal Sampling

TL;DR

This paper introduces subquadratic algorithms for approximate counting in spin systems, leveraging perfect marginal sampling techniques to surpass traditional quadratic-time barriers.

Contribution

It establishes a novel connection between perfect marginal sampling and subquadratic approximate counting, enabling faster algorithms for various spin models.

Findings

Achieved $ ilde{O}(n^{2- ext{delta}})$-time algorithms for hardcore model with certain parameters.

Connected perfect marginal sampling to subquadratic counting in a black-box manner.

Extended subquadratic counting algorithms to models like Ising, hypergraph independent sets, and colorings.

Abstract

We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the input graph. We present new counting algorithms that break the quadratic-time barrier in a wide range of settings. For example, for the hardcore model of $\lambda$-weighted independent sets in graphs of maximum degree $\Delta$, we obtain a $\tilde{O}(n^{2-\delta})$-time approximate counting algorithm, for some constant $\delta > 0$, when the fugacity $\lambda < \frac{1}{\Delta-1}$, improving over the previous regime of $\lambda = o(\Delta^{-3/2})$ by Anand, Feng, Freifeld, Guo, and Wang (2025). Our results apply broadly to many other spin systems, such as the Ising model, hypergraph independent sets, and vertex colorings. Interestingly, our work reveals a deep connection between $\textit{subquadratic}$ counting and $\textit{perfect}$ marginal sampling. For two-spin systems such as the hardcore and Ising models, we show that the existence of perfect marginal samplers directly yields subquadratic counting algorithms in a $\textit{black-box}$ fashion. For general spin systems, we show that almost all existing perfect marginal samplers can be adapted to produce a sufficiently low-variance marginal estimator in sublinear time, leading to subquadratic counting algorithms.