A faster implementation of the pivot algorithm for self-avoiding walks
From MaRDI portal
Publication:1599588
DOI10.1023/A:1013750203191zbMath1001.82061arXivcond-mat/0109308MaRDI QIDQ1599588
Publication date: 11 June 2002
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cond-mat/0109308
Statistical mechanics of polymers (82D60) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items
Persistence length convergence and universality for the self-avoiding random walk ⋮ On the Importance Sampling of Self-Avoiding Walks ⋮ Scale-free Monte Carlo method for calculating the critical exponentγof self-avoiding walks ⋮ An optimal algorithm to generate extendable self-avoiding walks in arbitrary dimension ⋮ Improved model for mixtures of polymers and hard spheres ⋮ Weakly directed self-avoiding walks ⋮ Exact sampling of self-avoiding paths via discrete Schramm-Loewner evolution ⋮ Transforming fixed-length self-avoiding walks into radial \(\text{SLE}_{8/3}\) ⋮ Computing the Loewner driving process of random curves in the half plane ⋮ The length of an SLE -- Monte Carlo studies ⋮ Efficiency of the incomplete enumeration algorithm for Monte-Carlo simulation of linear and branched polymers ⋮ Families of prudent self-avoiding walks ⋮ Conformal restriction: The chordal case ⋮ Monte Carlo study of four-dimensional self-avoiding walks of up to one billion steps ⋮ Efficient implementation of the Pivot algorithm for self-avoiding walks ⋮ Monte Carlo Methods for Lattice Polygons ⋮ Whole-plane self-avoiding walks and radial Schramm-Loewner evolution: a numerical study ⋮ Measuring shape with topology
