University of Warwick
  • Study
  • |
  • Research
  • |
  • Business
  • |
  • Alumni
  • |
  • News
  • Sign in
  • Computer Science Repository
  • More…

    Computer Science Repository

    • Home
    • About
    • Browse by Year
    • Browse by Subject
    • Browse by Division
    • Browse by Author
      • Login

    The computational complexity of two-state spin systems

    Goldberg, L.A., Jerrum, M. and Paterson, M.S. (2001) The computational complexity of two-state spin systems. Technical Report. Department of Computer Science, Coventry, UK.

    [img] PDF - Published Version
    Download (369Kb)

    Abstract

    The subject of this article is spin-systems as studied in statistical physics. We focus on the case of two spins. This case encompasses models of physical interest, such as the classical Ising model (ferromagnetic or antiferromagnetic, with or without an applied magnetic field) and the hard-core gas model. There are three degrees of freedom, corresponding to our parameters beta, gamma and mu. We wish to study the complexity of (approximately) computing the partition function in terms of these parameters. We pay special attention to the symmetric case mu=1 for which our results are depicted in Figure 1. Exact computation of the partition function Z is NP-hard except in the trivial case beta gamma=1, so we concentrate on the issue of whether Z can be computed within small relative error in polynomial time. We show that there is a fully polynomial randomised approximation scheme (FPRAS) for the partition function in the "ferromagnetic" region beta gamma >= 1, but (unless RP=NP) there is no FPRAS in the "antiferromagnetic" region corresponding to the square defined by 0<beta<1 and 0<gamma<1. Neither of these "natural" regions --- neither the hyperbola nor the square --- marks the boundary between tractable and intractable. In one direction, we provide an FPRAS for the partition function within a region which extends well away from the hyperbola. In the other direction, we exhibit two tiny, symmetric, intractable regions extending beyond the antiferromagnetic region. We also extend our results to the asymmetric case mu not equal to 1.

    Item Type: Monograph (Technical Report)
    Uncontrolled Keywords: technicalreport, randomised algorithm
    Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
    Divisions: Faculty of Science > Computer Science
    Depositing User: Mr Ebrahim Ardeshir
    Date Deposited: 14 Dec 2011 14:54
    Last Modified: 01 Nov 2012 18:06
    URI: http://eprints.dcs.warwick.ac.uk/id/eprint/1499

    Actions (login required)

    View Item View Item
    Close this email form
    Page contact: Repository administrator Last revised: Wed 21 Mar 2012
    • Sign in
    • | Powered by EPrints 3