Monte Carlo Methods for the Self-Avoiding Walk

Alan D. Sokal

Monte Carlo Methods for the Self-Avoiding Walk

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv hep-lat/9405016 v1 pith:YOV2YTQF submitted 1994-05-17 hep-lat cond-mat

Alan D. Sokal This is my paper

classification hep-latcond-mat

keywords carlomethodsmonteself-avoidingwalkalgorithmsarticledecade

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

This article is a pedagogical review of Monte Carlo methods for the self-avoiding walk, with emphasis on the extraordinarily efficient algorithms developed over the past decade.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Long range to short range crossover in one dimension
cond-mat.stat-mech 2025-07 conditional novelty 5.0 of 10

A 1D self-avoiding Levy-flight simulation supports Sak's LR-to-SR crossover at sigma*=1, with long-range exponents close to, but distinct from, Flory predictions.

Pith tools