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 FPRASes for the Potts model and the number of k-colorings of the graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.