FPRAS for the Potts Model and the Number of k-colorings
Zonglei BaiYongzhi CaoHanpin Wang
所有作者
Zonglei BaiYongzhi CaoHanpin Wang
文献摘要
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.