activity
20102026
most citedDeterministic polynomial-time approximation algorithms for partition functions and graph polynomials

115 citations · 254 across the 43 of their papers we have counts for

collaborators
Showing cs.DSShow all

6 papers · 1 filter

cs.DS2025

On zeros and algorithms for disordered systems: mean-field spin glasses

Ferenc Bencs, Brice Huang, Daniel Z. Lee +2

Spin glasses are fundamental probability distributions at the core of statistical physics, the theory of average-case computational complexity, and modern high-dimensional statisti…

cs.DS2025

Barvinok's interpolation method meets Weitz's correlation decay approach

Ferenc Bencs, Guus Regts

In this paper we take inspiration from Weit'z algorithm for approximating the independence polynomial to provide a new algorithm for computing the coefficients of the Taylor series…

cs.DS2022★ 2 cited

Approximate counting using Taylor's theorem: a survey

Viresh Patel, Guus Regts

In this article we consider certain well-known polynomials associated with graphs including the independence polynomial and the chromatic polynomial. These polynomials count certai…

cs.DS2019★ 3 cited

Statistical physics approaches to Unique Games

Matthew Coulson, Ewan Davies, Alexandra Kolla +2

We show how two techniques from statistical physics can be adapted to solve a variant of the notorious Unique Games problem, potentially opening new avenues towards the Unique Game…

cs.DS2018★ 38 cited

Algorithmic Pirogov-Sinai theory

Tyler Helmuth, Will Perkins, Guus Regts

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…

cs.DS2017

Computing the number of induced copies of a fixed graph in a bounded degree graph

Viresh Patel, Guus Regts

In this paper we show that for any graph of order and any graph of order and maximum degree one can compute the number of subsets of that induces a g…