Abstract
In the Ising model, we consider the problem of estimating the covariance of the spins at two specified vertices. In the ferromagnetic case, it is easy to obtain an additive approximation to this covariance by repeatedly sampling from the relevant Gibbs distribution. However, we desire a multiplicative approximation, and it is not clear how to achieve this by sampling, given that the covariance can be exponentially small. Our main contribution is a fully polynomial time randomised approximation scheme (FPRAS) for the covariance in the ferromagnetic case. We also show that the restriction to the ferromagnetic case is essential—there is no FPRAS for multiplicatively estimating the covariance of an antiferromagnetic Ising model unless RP = #P. In fact, we show that even determining the sign of the covariance is #P-hard in the antiferromagnetic case.
- Andrea Collevecchio, Timothy M. Garoni, Timothy Hyndman, and Daniel Tokarev. 2016. The worm process for the Ising model is rapidly mixing. J. Stat. Phys. 164, 5 (2016), 1082--1102.Google Scholar
Cross Ref
- Persi Diaconis and Daniel Stroock. 1991. Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1, 1 (1991), 36--61. Retrieved from http://links.jstor.org.ezproxy.library.qmul.ac.uk/sici?sici=1050-5164(199102)1:1<36:GBFEOM>2.0.CO;2-E8origin=MSN.Google Scholar
Cross Ref
- Robert G. Edwards and Alan D. Sokal. 1988. Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Phys. Rev. D 38 (Sep. 1988), 2009--2012. Issue 6.Google Scholar
Cross Ref
- C. M. Fortuin and P. W. Kasteleyn. 1972. On the random-cluster model. I. Introduction and relation to other models. Physica 57 (1972), 536--564.Google Scholar
Cross Ref
- Leslie Ann Goldberg and Mark Jerrum. 2014. The complexity of computing the sign of the Tutte polynomial. SIAM J. Comput. 43, 6 (2014), 1921--1952.Google Scholar
Cross Ref
- Geoffrey Grimmett. 2006. The Random-Cluster Model. Grundlehren der Mathematischen Wissenschaften {Fundamental Principles of Mathematical Sciences}, vol. 333. Springer-Verlag, Berlin.Google Scholar
- Mark Jerrum and Alistair Sinclair. 1993. Polynomial-time approximation algorithms for the Ising model. SIAM J. Comput. 22, 5 (1993), 1087--1116. Google Scholar
Digital Library
- Mark Jerrum, Alistair Sinclair, and Eric Vigoda. 2004. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. ACM 51, 4 (2004), 671--697. Google Scholar
Digital Library
- Michael Mitzenmacher and Eli Upfal. 2005. Probability and Computing. Cambridge University Press, Cambridge.Google Scholar
- Dana Randall and David Wilson. 1999. Sampling spin configurations of an Ising system. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’99). Society for Industrial and Applied Mathematics, Philadelphia, PA, 959--960. Retrieved from http://dl.acm.org/citation.cfm?id=314500.314945. Google Scholar
Digital Library
- Jason Schweinsberg. 2002. An O(n<sup>2</sup>) bound for the relaxation time of a Markov chain on cladograms. Random Struct. Algor. 20, 1 (2002), 59--70. Google Scholar
Digital Library
- Alistair Sinclair. 1992. Improved bounds for mixing rates of Markov chains and multicommodity flow. Combin. Probab. Comput. 1, 4 (1992), 351--370.Google Scholar
Cross Ref
- L. G. Valiant. 1982. A scheme for fast parallel communication. SIAM J. Comput. 11, 2 (1982), 350--361.Google Scholar
Digital Library
- Bartel L. van der Waerden. 1941. Die lange Reichweite der regelmäßigen Atomanordnung in Mischkristallen. Zeitschrift für Physik 118, 7 (1941), 473--488.Google Scholar
Cross Ref
- Dirk Vertigan and Dominic J. A. Welsh. 1992. The compunational complexity of the Tutte plane: The bipartite case. Combin. Prob. Comput. 1 (1992), 181--187.Google Scholar
Cross Ref
Index Terms
Approximating Pairwise Correlations in the Ising Model
Recommendations
The Complexity of Approximating the Complex-Valued Ising Model on Bounded Degree Graphs
We study the complexity of approximating the partition function $Z_{\mathrm{Ising}}(G; \beta)$ of the Ising model in terms of the relation between the edge interaction $\beta$ and a parameter $\Delta$ which is an upper bound on the maximum degree of the ...
Exploring the renormalization of quantum discord and Bell non-locality in the one-dimensional transverse Ising model
In this paper, the effect of external magnet field g on the relationship among the quantum discord, Bell non-locality and quantum phase transition by employing quantum renormalization-group (QRG) method in the one-dimensional transverse Ising model is ...
Thermal quantum discord and classical correlations in a two-qubit Ising model under a site-dependent magnetic field
We investigate the thermal quantum discord and classical correlations in a two-qubit Ising model interacting with a site-dependent external magnetic field. Systematic study of all correlations is performed for various values of the system's temperature, ...






Comments