Viresh Patel | DeepAI

DeepAI AI Chat

Featured Co-authors

Daniël Paulusma
59 publications
Matthew Alastair Johnson
35 publications
Stefan Kratsch
26 publications
Andreas Galanis
23 publications
Guus Regts
14 publications
Ross J. Kang
13 publications
Pieter Kleer
12 publications
Ewan Davies
11 publications
Wouter Cames van Batenburg
10 publications
Alexandra Kolla
9 publications
N. R. Aravind
8 publications

∙ 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 ...

0 Matthew Jenssen, et al. ∙

∙ 12/15/2022

Approximate counting using Taylor's theorem: a survey

In this article we consider certain well-known polynomials associated wi...

0 Viresh Patel, et al. ∙

∙ 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...

0 Jeroen Huijben, et al. ∙

∙ 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...

0 Pieter Kleer, et al. ∙

∙ 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...

0 Viresh Patel, et al. ∙

∙ 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...

0 Pjotr Buys, et al. ∙

∙ 12/31/2019

Structure and colour in triangle-free graphs

Motivated by a recent conjecture of the first author, we prove that ever...

0 N. R. Aravind, et al. ∙

∙ 11/04/2019

Statistical physics approaches to Unique Games

We show how two techniques from statistical physics can be adapted to so...

0 Matthew Coulson, et al. ∙

∙ 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 ...

0 Ferenc Bencs, et al. ∙

∙ 03/25/2014

Finding Shortest Paths between Graph Colourings

The k-colouring reconfiguration problem asks whether, for a given graph ...

0 Matthew Alastair Johnson, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world