Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1005.5584

Computational Transition at the Uniqueness Threshold

Allan Sly
View original source ↗Read source document ↗Export metadata ↓

Abstract

The hardcore model is a model of lattice gas systems which has received much attention in statistical physics, probability theory and theoretical computer science. It is the probability distribution over independent sets $I$ of a graph weighted proportionally to $λ^{|I|}$ with fugacity parameter $λ$. We prove that at the uniqueness threshold of the hardcore model on the $d$-regular tree, approximating the partition function becomes computationally hard on graphs of maximum degree $d$. Specifically, we show that unless NP$=$RP there is no polynomial time approximation scheme for the partition function (the sum of such weighted independent sets) on graphs of maximum degree $d$ for fugacity $λ_c(d) < λ< λ_c(d) + ε(d)$ where $λ_c = \frac{(d-1)^{d-1}}{(d-2)^d}$ is the uniqueness threshold on the $d$-regular tree and $ε(d)>0$. Weitz produced an FPTAS for approximating the partition function when $0<λ< λ_c(d)$ so this result demonstrates that the computational threshold exactly coincides with the statistical physics phase transition thus confirming the main conjecture of [28]. We further analyze the special case of $λ=1, d=6$ and show there is no polynomial time algorithm for approximately counting independent sets on graphs of maximum degree $d= 6$ which is optimal. Our proof is based on specially constructed random bi-partite graphs which act as gadgets in a reduction to MAX-CUT. Building on the second moment method analysis of [28] and combined with an analysis of the reconstruction problem on the tree our proof establishes a strong version of 'replica' method heuristics developed by theoretical physicists. The result establishes the first rigorous correspondence between the hardness of approximate counting and sampling with statistical physics phase transitions.

Explore related subjects

cs.CCmath-phmath.MPmath.PR

Keep this discovery

BibTeXRIS

Allan Sly. 2010-05-31. Computational Transition at the Uniqueness Threshold. https://arxiv.org/abs/1005.5584

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗