  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.
