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

arXiv1902.09114MaRDI QIDQ6314554FDOQ6314554

Zonglei Bai, Hanpin Wang, Yongzhi Cao

Publication date: 25 February 2019

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 page was built for publication: FPRAS for the Potts Model and the Number of $k$-colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6314554)