Years and Authors of Summarized Original Work
1993; Jerrum, Sinclair
2003; Goldberg, Jerrum, Paterson
2006; Weitz
2012; Sinclair, Srivastava, Thurley
2013; Li, Lu, Yin
2015; Sinclair, Srivastava, Štefankovič, Yin
Problem Definition
Spin systems are well-studied objects in statistical physics and applied probability. An instance of a spin system is an undirected graphG = (V, E) of n vertices. A configuration of a two-state spin system, or simply just two-spin system on G, is an assignment \(\sigma : V \rightarrow \{ 0,1\}\) of two spin states “0” and “1” (sometimes called “−” and “+” or seen as two colors) to the vertices of G. Let \(\mathbf{A} = \left [\begin{array}{*{10}c} A_{0,0}&A_{0,1} \\ A_{1,0}&A_{1,1} \end{array} \right ]\) be a nonnegative symmetric matrix which specifies the local interactions between adjacent vertices and \(\mathbf{b} = \left [\begin{array}{*{10}c} b_{0} \\ b_{1} \end{array} \right ]\)a nonnegative vector which specifies preferences of individual vertices...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Bulatov AA, Grohe M (2005) The complexity of partition functions. Theor Comput Sci 348(2–3):148–186
Goldberg LA, Jerrum M, Paterson M (2003) The computational complexity of two-state spin systems. Random Struct Algorithms 23(2):133–154
Jerrum M, Sinclair A (1993) Polynomial-time approximation algorithms for the ising model. SIAM J Comput 22(5):1087–1116
Li L, Lu P, Yin Y (2012) Approximate counting via correlation decay in spin systems. In: Proceedings of SODA, Kyoto, pp 922–940
Li L, Lu P, Yin Y (2013) Correlation decay up to uniqueness in spin systems. In: Proceedings of SODA, New Orleans, pp 67–84
Liu J, Lu P, Zhang C (2014) The complexity of ferromagnetic two-spin systems with external fields. In: Proceedings of RANDOM, Barcelona. To appear
Lu P, Wang M, Zhang C (2014) Fptas for weighted fibonacci gates and its applications. In: Esparza J, Fraigniaud P, Husfeldt T, Koutsoupias E (eds) ICALP (1), Copenhagen. Lecture Notes in Computer Science, vol 8572. Springer, pp 787–799
Sinclair A, Srivastava P, Thurley M (2012) Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. In: Proceedings of SODA, Kyoto, pp 941–953
Sinclair A, Srivastava P, Yin Y (2013) Spatial mixing and approximation algorithms for graphs with bounded connective constant. In: Proceedings of FOCS, Berkeley, pp 300–309
Sinclair A, Srivastava P, Štefankovič D, Yin Y (2015) Spatial mixing and the connective constant: Optimal bounds. In: Proceedings of SODA, San Diego. To appear
Sly A, Sun N (2012) The computational hardness of counting in two-spin models on d-regular graphs. In: Proceedings of FOCS, New Brunswick, pp 361–369
Weitz D (2006) Counting independent sets up to the tree threshold. In: Proceedings of STOC, Seattle, pp 140–149
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Lu, P., Yin, Y. (2016). Approximating the Partition Function of Two-Spin Systems. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_750
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_750
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering