Approximating the partition function of the ferromagnetic Potts model

Details Approximating the partition function of the ferromagnetic Potts model Approximating the partition function of the ferromagnetic Potts model

2010-02-04

arxiv.org/abs/1002.0986v2

Computer Science

Computational Complexity

Minor corrections, some additional references.

Scientific paper

We provide evidence that it is computationally difficult to approximate the partition function of the ferromagnetic q-state Potts model when q>2. Specifically we show that the partition function is hard for the complexity class #RHPi_1 under approximation-preserving reducibility. Thus, it is as hard to approximate the partition function as it is to find approximate solutions to a wide range of counting problems, including that of determining the number of independent sets in a bipartite graph. Our proof exploits the first order phase transition of the "random cluster" model, which is a probability distribution on graphs that is closely related to the q-state Potts model.

Affiliated with

Also associated with

No associations

Rating

Approximating the partition function of the ferromagnetic Potts model does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximating the partition function of the ferromagnetic Potts model, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating the partition function of the ferromagnetic Potts model will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-154976