115 citations · 203 across the 24 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020
Switch-based Markov Chains for Sampling Hamiltonian Cycles in Dense Graphs
Pieter Kleer, Viresh Patel, Fabian Stroh
We consider the irreducibility of switch-based Markov chains for the approximate uniform sampling of Hamiltonian cycles in a given undirected dense graph on vertices. As our ma…
math.CO2020
A polynomial-time algorithm to determine (almost) Hamiltonicity of dense regular graphs
Viresh Patel, Fabian Stroh
We give a polynomial-time algorithm for detecting very long cycles in dense regular graphs. Specifically, we show that, given , there exists a such that the fo…
cs.CC2020
Lee-Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs
Pjotr Buys, Andreas Galanis, Viresh Patel +1
We study the computational complexity of approximating the partition function of the ferromagnetic Ising model with the external field parameter on the unit circle in the compl…