FPRAS for the Potts Model and the Number of $k$-colorings

Abstract

In this paper, we give a sampling algorithm for the Potts model using Markov chains. Based on the sampling algorithm, we give \emph{FPRAS}es for the Potts model and the number of $k$-colorings of the graph.

We find an error in the analysis of the algorithm, and it makes the results wrong

References in corpus (1)

• An FPTAS for Counting Proper Four-Colorings on Cubic Graphs