Pith. sign in

REVIEW 1 cited by

Dynamic critical behavior of the worm algorithm for the Ising model

Not yet reviewed by Pith; the record is open.

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 cond-mat/0703787 v2 pith:G3JLNQS4 submitted 2007-03-29 cond-mat.stat-mech

classification cond-mat.stat-mech
keywords algorithmbehaviorisingwormcriticaldynamicmodelthree-dimensional
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study the dynamic critical behavior of the worm algorithm for the two- and three-dimensional Ising models, by Monte Carlo simulation. The autocorrelation functions exhibit an unusual three-time-scale behavior. As a practical matter, the worm algorithm is slightly more efficient than Swendsen-Wang for simulating the two-point function of the three-dimensional Ising model.

Discussion (0). Continue with ORCID 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

  1. Correction-to-scaling exponent for percolation and the Fortuin--Kasteleyn Potts model in two dimensions

    cond-mat.stat-mech 2024-11 conditional novelty 5.0 of 10

    For two-dimensional Fortuin-Kasteleyn Potts clusters, the correction-to-scaling exponent is predicted exactly as Ω = 8/[(2g+1)(2g+3)] = 1/(g d_f), matching Monte Carlo data for Q=1,2,3,4 on critical and tricritical branches.

Pith tools