FPTAS for Hardcore and Ising Models on Hypergraphs

@article{Lu2016FPTASFH,
  title={FPTAS for Hardcore and Ising Models on Hypergraphs},
  author={Pinyan Lu and K. Yang and Chihao Zhang},
  journal={ArXiv},
  year={2016},
  volume={abs/1509.05494}
}
  • Pinyan Lu, K. Yang, Chihao Zhang
  • Published 2016
  • Computer Science, Mathematics
  • ArXiv
  • Hardcore and Ising models are two most important families of two state spin systems in statistic physics. Partition function of spin systems is the center concept in statistic physics which connects microscopic particles and their interactions with their macroscopic and statistical properties of materials such as energy, entropy, ferromagnetism, etc. If each local interaction of the system involves only two particles, the system can be described by a graph. In this case, fully polynomial-time… CONTINUE READING
    The Ising Partition Function: Zeros and Deterministic Approximation
    • 19
    • PDF
    The Ising Partition Function: Zeros and Deterministic Approximation
    • 14
    • PDF
    Counting hypergraph matchings up to uniqueness threshold
    Counting Hypergraph Matchings up to Uniqueness Threshold
    • 9
    • PDF
    More on zeros and approximation of the Ising partition function
    Approximation via Correlation Decay When Strong Spatial Mixing Fails
    • 4
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 35 REFERENCES
    The Computational Hardness of Counting in Two-Spin Models on d-Regular Graphs
    • 106
    • PDF
    Correlation Decay up to Uniqueness in Spin Systems
    • 94
    • PDF
    Improved FPTAS for Multi-spin Systems
    • 35
    • PDF
    Approximate counting via correlation decay in spin systems
    • 53
    • PDF
    FPTAS for Weighted Fibonacci Gates and Its Applications
    • 14
    • PDF