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

Hanpin Wang; Yongzhi Cao; Zonglei Bai

arxiv: 1902.09114 · v3 · pith:VYQDWRPNnew · submitted 2019-02-25 · 💻 cs.DS · cs.CC· math.CO

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

Zonglei Bai , Yongzhi Cao , Hanpin Wang This is my paper

classification 💻 cs.DS cs.CCmath.CO

keywords modelpottsalgorithmcoloringsfprasgivenumbersampling

0 comments

read the original 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.

This paper has not been read by Pith yet.

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

discussion (0)