Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
139 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity (2401.09317v2)

Published 17 Jan 2024 in math-ph, cs.DS, math.CO, math.MP, and math.PR

Abstract: We present a unifying approach to derive the strong spatial mixing (SSM) property for the general 2-spin system from zero-free regions of its partition function. Our approach works for the multivariate partition function over all three complex parameters $(\beta, \gamma, \lambda)$, and we allow the zero-free regions of $\beta, \gamma$ or $\lambda$ to be of arbitrary shapes. As long as the zero-free region contains a positive point and it is a complex neighborhood of $\lambda=0$ when fixing $\beta, \gamma \in \mathbb{C}$, or a complex neighborhood of $\beta\gamma=1$ when fixing $\beta, \lambda\in \mathbb{C}$ or $\gamma, \lambda\in \mathbb{C}$ respectively, we are able to show that the corresponding 2-spin system exhibits SSM on such a region. The underlying graphs of the 2-spin system are not necessarily of bounded degree, while are required to include graphs with pinned vertices. We prove this result by establishing a Christoffel-Darboux type identity for the 2-spin system on trees. This identity plays an important role in our approach and is of its own interests. We also use certain tools from complex analysis such as Riemann mapping theorem. Our approach comprehensively turns all existing zero-free regions (to our best knowledge) of the partition function of the 2-spin system where pinned vertices are allowed into the SSM property. As a consequence, we obtain new SSM results for the 2-spin system beyond the direct argument for SSM based on tree recurrence. Moreover, we extend our approach to handle the 2-spin system with non-uniform external fields. As an application, we obtain a new SSM result for the non-uniform ferromagnetic Ising model from the celebrated Lee-Yang circle theorem.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (39)
  1. Taro Asano. Lee-Yang theorem and the Griffiths inequality for the anisotropic Heisenberg ferromagnet. Physical Review Letters, 24(25):1409, 1970.
  2. Francisco Barahona. On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical and General, 15(10):3241, 1982.
  3. Alexander Barvinok. Combinatorics and complexity of partition functions, volume 30. Springer, 2016.
  4. On complex roots of the independence polynomial. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 675–699. SIAM, 2023.
  5. Ferenc Bencs. Christoffel–Darboux type identities for the independence polynomial. Combinatorics, Probability and Computing, 27(5):716–724, 2018.
  6. Lee–Yang zeros and the complexity of the ferromagnetic Ising model on bounded-degree graphs. In Forum of Mathematics, Sigma, volume 10, page e7. Cambridge University Press, 2022.
  7. Graph homomorphisms with complex values: A dichotomy theorem. SIAM Journal on Computing, 42(3):924–1029, 2013.
  8. The complexity of complex weighted Boolean #CSP. Journal of Computer and System Sciences, 80(1):217–236, 2014.
  9. Peter V. Dovbush. Applications of Zalcman’s lemma in ℂnsuperscriptℂ𝑛\mathbb{C}^{n}blackboard_C start_POSTSUPERSCRIPT italic_n end_POSTSUPERSCRIPT. In Current Trends in Analysis, its Applications and Computation: Proceedings of the 12th ISAAC Congress, Aveiro, Portugal, 2019, pages 67–74. Springer, 2021.
  10. Completely analytical gibbs fields. In Statistical Physics and Dynamical Systems: Rigorous Results, pages 371–403. Springer, 1985.
  11. Completely analytical interactions: constructive description. Journal of Statistical Physics, 46:983–1014, 1987.
  12. Michael E. Fisher. The Nature of Critical Points. University of Colorado Press, 1965.
  13. David Gamarnik. Correlation decay and the absence of zeros property of partition functions. Random Structures & Algorithms, 62(1):155–180, 2023.
  14. Uniqueness, spatial mixing, and approximation for ferromagnetic 2-spin systems. ACM Transactions on Computation Theory (TOCT), 10(4):1–25, 2018.
  15. Zeros of ferromagnetic 2-spin systems. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 181–192. SIAM, 2020.
  16. The (ϕitalic-ϕ\phiitalic_ϕ^4)_2 field theory as a classical Ising model. Communications in Mathematical Physics, 1973.
  17. Ivan Gutman. An identity for the independence polynomials of trees. Publ. Inst. Math.(Belgrade), 50:19–23, 1991.
  18. Polynomial-time approximation algorithms for the Ising model. SIAM Journal on computing, 22(5):1087–1116, 1993.
  19. Approximate counting via correlation decay in spin systems. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 922–940. SIAM, 2012.
  20. Correlation decay up to uniqueness in spin systems. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 67–84. SIAM, 2013.
  21. A general Lee-Yang theorem for one-component and multicomponent ferromagnets. Communications in Mathematical Physics, 80(2):153–179, 1981.
  22. Fisher zeros and correlation decay in the Ising model. Journal of Mathematical Physics, 60(10), 2019.
  23. The Ising partition function: Zeros and deterministic approximation. Journal of Statistical Physics, 174(2):287–315, 2019.
  24. Correlation decay and partition function zeros: Algorithms and phase transitions. SIAM Journal on Computing, (0):FOCS19–200, 2022.
  25. Statistical theory of equations of state and phase transitions. II. Lattice gas and Ising model. Physical Review, 87(3):410, 1952.
  26. Charles M. Newman. Zeros of the partition function for generalized Ising systems. Communications on Pure and Applied Mathematics, 27(2):143–159, 1974.
  27. Complex analysis in one variable. Springer Science & Business Media, 2012.
  28. Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials. SIAM Journal on Computing, 46(6):1893–1919, 2017.
  29. On a conjecture of sokal concerning roots of the independence polynomial. Michigan Mathematical Journal, 68(1):33–55, 2019.
  30. Location of zeros for the partition function of the Ising model on bounded degree graphs. Journal of the London Mathematical Society, 101(2):765–785, 2020.
  31. Guus Regts. Absence of zeros implies strong spatial mixing. Probability Theory and Related Fields, pages 1–21, 2023.
  32. David Ruelle. Extension of the Lee-Yang circle theorem. Physical Review Letters, 26(6):303, 1971.
  33. Volker Scheidemann. Introduction to complex analysis in several variables. Springer, 2005.
  34. Complex analysis, volume 2. Princeton University Press, 2010.
  35. Contraction: A unified perspective of correlation decay and zero-freeness of 2-spin systems. Journal of Statistical Physics, 185:1–25, 2021.
  36. Approximation algorithms for two-state anti-ferromagnetic spin systems on bounded degree graphs. Journal of Statistical Physics, 155(4):666–686, 2014.
  37. Dror Weitz. Counting independent sets up to the tree threshold. In Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 140–149, 2006.
  38. Statistical theory of equations of state and phase transitions. I. Theory of condensation. Physical Review, 87(3):404, 1952.
  39. Approximating partition functions of the two-state spin system. Information Processing Letters, 111(14):702–710, 2011.
Citations (1)

Summary

We haven't generated a summary for this paper yet.