Counting in two-spin models on d-regular graphs

Keyphrases

• Spin Models 100%
• Regular Graph 100%
• Two-spin System 100%
• Partition Function 66%
• Locally Tree-like 66%
• Statistical Physics 33%
• NP-hard 33%
• Hardcore Model 33%
• Computational Complexity 33%
• External Field 33%
• Local Structure 33%
• Expander Graphs 33%
• Bethe 33%
• Antiferromagnetic Ising Model 33%
• Regular Tree 33%
• Second Moment Method 33%
• Free Energy Density 33%
• Bounded Degree Graphs 33%
• Non-uniqueness 33%
• Bipartite Expanders 33%
• Complete Classification 33%

Mathematics

• Partition Function 100%
• Spin Model 100%
• Regular Graph 100%
• Tree-Like 100%
• Approximates 50%
• External Field 50%
• Coincides 50%
• Srivastava 50%
• Regular Tree 50%
• Energy Density 50%
• Expander Graphs 50%
• Complete Classification 50%
• Nonuniqueness 50%

Physics

• Spin System 100%
• Free Energy 33%
• Flux Density 33%
• Ising Model 33%
• Statistical Physics 33%