The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Worm Algorithms for Classical Statistical Models
Open accessAbstract
We show that high-temperature expansions provide a basis for the novel approach to efficient Monte Carlo simulations. "Worm" algorithms utilize the idea of updating closed-path configurations (produced by high-temperature expansions) through the motion of end points of a disconnected path. An amazing result is that local, Metropolis-type schemes using this approach appear to have dynamical critical exponents close to zero (i.e., their efficiency is comparable to the best cluster methods) as proved by finite-size scaling of the autocorrelation time for various universality classes.
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
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Phase Transitions and Critical Phenomena
(2016) · Statistical and Thermal Physics · doi:10.1201/9781439850541-13 · Cited by 11,176
Nonuniversal critical dynamics in Monte Carlo simulations
Swendsen, R. H., & Wang, J.-S. (1987) · Physical Review Letters · doi:10.1103/physrevlett.58.86 · Cited by 2,844
Collective Monte Carlo Updating for Spin Systems
Wolff, U. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.361 · Cited by 2,551
Modern Theory Of Critical Phenomena
Ma, S.-K. (2018) · Routledge eBooks · doi:10.4324/9780429498886 · Cited by 2,043
Modern Theory of Critical Phenomena
Osborn, H. (1977) · Physics Bulletin · doi:10.1088/0031-9112/28/4/035 · Cited by 1,882
(2018) · Physics Subject Headings (PhySH) · doi:10.29172/0660b3fe-654b-49c9-a7fa-79f18efe2aa0 · Cited by 882
Path-integral computation of superfluid densities
Pollock, E. L., & Ceperley, D. M. (1987) · Physical Review B · doi:10.1103/physrevb.36.8343 · Cited by 664
Ising universality in three dimensions: a Monte Carlo study
Blote, H. W. J., Luijten, E., & Heringa, J. R. (1995) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/28/22/007 · Cited by 307
“Worm” algorithm in quantum Monte Carlo simulations
Prokof'ev, N. V., Svistunov, B. V., & Tupitsyn, I. S. (1998) · Physics Letters A · doi:10.1016/s0375-9601(97)00957-2 · Cited by 272
Self-citation
Cited by
Boninsegni, M., Prokof’ev, N. V., & Svistunov, B. V. (2006) · Physical Review E · doi:10.1103/physreve.74.036701 · Cited by 428
Self-citation
Metadata
- Authors
- Prokof'ev, N., & Svistunov, B.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2001-09-27
- Volume
- 87
- Issue
- 16
- Pages
- 160601-160601
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1981361326
- Cited by
- 360
- References
- 15
- FWCI
- 3.27
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Worm Algorithms for Classical Statistical Models. https://app.cochat.ai/papers/10.1103/physrevlett.87.160601
- The paper
- Prokof'ev, N., & Svistunov, B. (2001). Worm Algorithms for Classical Statistical Models. Physical Review Letters. https://doi.org/10.1103/physrevlett.87.160601
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.
