research
∙
09/19/2023
Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
We prove that for any graph G of maximum degree at most Δ, the zeros of ...
share
research
∙
12/15/2022
Approximate counting using Taylor's theorem: a survey
In this article we consider certain well-known polynomials associated wi...
research
∙
03/12/2021
Sampling from the low temperature Potts model through a Markov chain on flows
In this paper we consider the algorithmic problem of sampling from the P...
research
∙
11/19/2020
Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs
We consider the irreducibility of switch-based Markov chains for the app...
research
∙
07/28/2020
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
We give a polynomial-time algorithm for detecting very long cycles in de...
research
∙
06/26/2020
Lee-Yang zeros and the complexity of the ferromagnetic Ising Model on bounded-degree graphs
We study the computational complexity of approximating the partition fun...
research
∙
12/31/2019
Structure and colour in triangle-free graphs
Motivated by a recent conjecture of the first author, we prove that ever...
research
∙
11/04/2019
Statistical physics approaches to Unique Games
We show how two techniques from statistical physics can be adapted to so...
research
∙
12/18/2018
On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs
For a graph G=(V,E), k∈N, and a complex number w the partition function ...
research
∙
03/25/2014
