The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk

668 indexed citations

Abstract

loading...

About

This paper, published in 1988, received 668 indexed citations. Written by Neal Madras and Alan D. Sokal covering the research area of Mathematical Physics, Condensed Matter Physics and Statistics and Probability. It is primarily cited by scholars working on Condensed Matter Physics (303 citations), Materials Chemistry (235 citations) and Mathematical Physics (145 citations). Published in Journal of Statistical Physics.

Countries where authors are citing The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk

Specialization
Citations

This map shows the geographic impact of The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk more than expected).

Fields of papers citing The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk

Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk.

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

This paper is also available at doi.org/10.1007/bf01022990.

Explore hit-papers with similar magnitude of impact

Rankless by CCL
2026