The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Polynomial-Time Approximation Algorithms for the Ising Model
Abstract
The paper presents a randomised algorithm which evaluates the partition function of an arbitrary ferromagnetic Ising system to any specified degree of accuracy. The running time of the algorithm increases only polynomially with the size of the system (i.e., the number of sites) and a parameter which controls the accuracy of the result. Further approximation algorithms are presented for the mean energy and the mean magnetic moment of ferromagnetic Ising systems. The algorithms are based on Monte Carlo simulation of a suitably defined ergodic Markov chain. The states of the chain are not, as is customary, Ising spin configurations, but spanning subgraphs of the interaction graph of the system. It is shown that the expectations of simple operators on these configurations give numerical information about the partition function and related quantities. The performance guarantees for the algorithms are rigorously derived and rest on the fact that the Markov chain in question is rapidly mixing, i.e., converges to its equilibrium distribution in a polynomial number of steps. This is apparently the first time that rapid mixing has been demonstrated at all temperatures for a Markov chain related to the Ising model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Beitrag zur Theorie des Ferromagnetismus
Ising, E. (1925) · Zeitschrift für Physik · doi:10.1007/bf02980577 · Cited by 3,871
The Art of Computer Programming
Worlton, W. J. (1968) · Nuclear Science and Engineering · doi:10.13182/nse68-a19548 · Cited by 2,251
Some simplified NP-complete graph problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90059-1 · Cited by 2,059
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
An Introduction to Probability Theory and Its Applications, Vol. 2
Feller, W., & Teichmann, T. (1967) · Physics Today · doi:10.1063/1.3034322 · Cited by 1,280
Alon, N. (1986) · Combinatorica · doi:10.1007/bf02579166 · Cited by 1,137
Random generation of combinatorial structures from a uniform distribution
Jerrum, M. R., Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90174-x · Cited by 985
Self-citationDimer Statistics and Phase Transitions
Kasteleyn, P. W. (1963) · Journal of Mathematical Physics · doi:10.1063/1.1703953 · Cited by 946
Geometric Bounds for Eigenvalues of Markov Chains
Diaconis, P., & Stroock, D. (1991) · The Annals of Applied Probability · doi:10.1214/aoap/1177005980 · Cited by 882
Luis Balcázar, J., Díaz, J., & Gabarró, J. (1995) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/978-3-642-79235-9 · Cited by 866
Jerrum, M., & Sinclair, A. (1989) · SIAM Journal on Computing · doi:10.1137/0218077 · Cited by 768
Self-citationApproximate counting, uniform generation and rapidly mixing Markov chains
Sinclair, A., & Jerrum, M. (1989) · Information and Computation · doi:10.1016/0890-5401(89)90067-9 · Cited by 735
Self-citationA random polynomial-time algorithm for approximating the volume of convex bodies
Dyer, M., Frieze, A., & Kannan, R. (1991) · Journal of the ACM · doi:10.1145/102782.102783 · Cited by 693
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Sinclair, A. (1992) · Combinatorics, Probability and Computing · doi:10.1017/s0963548300000390 · Cited by 498
Self-citationOn the Theory of the Ising Model of Ferromagnetism
Newell, G. F., & Montroll, E. W. (1953) · Reviews of Modern Physics · doi:10.1103/revmodphys.25.353 · Cited by 477
Difference equations, isoperimetric inequality and transience of certain random walks
Dodziuk, J. (1984) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-1984-0743744-x · Cited by 475
An Introduction to the Ising Model
Cipra, B. A. (1987) · The American Mathematical Monthly · doi:10.1080/00029890.1987.12000742 · Cited by 419
Algorithms for Random Generation and Counting: A Markov Chain Approach
Sinclair, A. (1993) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0323-0 · Cited by 380
Self-citationOn the Dimer Solution of Planar Ising Models
Fisher, M. E. (1966) · Journal of Mathematical Physics · doi:10.1063/1.1704825 · Cited by 347
Isoperimetric numbers of graphs
Mohar, B. (1989) · Journal of Combinatorial Theory, Series B · doi:10.1016/0095-8956(89)90029-4 · Cited by 331
Two-dimensional monomer-dimer systems are computationally intractable
Jerrum, M. (1987) · Journal of Statistical Physics · doi:10.1007/bf01010403 · Cited by 124
Self-citationSome observations on the probabilistic algorithms and NP-hard problems
Ko, K. (1982) · Information Processing Letters · doi:10.1016/0020-0190(82)90139-9 · Cited by 82
Cited by
The Cross-Entropy Method for Combinatorial and Continuous Optimization
Rubinstein, R. (1999) · Methodology And Computing In Applied Probability · doi:10.1023/a:1010091220143 · Cited by 903
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Sinclair, A. (1992) · Combinatorics, Probability and Computing · doi:10.1017/s0963548300000390 · Cited by 498
Self-citationLectures on finite Markov chains
Saloff-Coste, L. (1997) · Lecture Notes in Mathematics · doi:10.1007/bfb0092621 · Cited by 382
A New Class of Upper Bounds on the Log Partition Function
Wainwright, M. J., Jaakkola, T. S., & Willsky, A. S. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.850091 · Cited by 381
Moore, C., & Mertens, S. (2011) · doi:10.1093/acprof:oso/9780199233212.001.0001 · Cited by 347
Metadata
- Authors
- Jerrum, M., & Sinclair, A.
- Venue
- SIAM Journal on Computing
- Published
- 1993-10
- Volume
- 22
- Issue
- 5
- Pages
- 1087-1116
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2024710200
- Cited by
- 548
- References
- 23
- FWCI
- 7.41
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.