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

N Madras, AD Sokal - Journal of Statistical Physics, 1988 - Springer
The pivot algorithm is a dynamic Monte Carlo algorithm, first invented by Lal, which
generates self-avoiding walks (SAWs) in a canonical (fixed-N) ensemble with free endpoints …

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

N Madras, AD Sokal - Journal of Statistical Physics, 1988 - ui.adsabs.harvard.edu
The pivot algorithm is a dynamic Monte Carlo algorithm, first invented by Lal, which
generates self-avoiding walks (SAWs) in a canonical (fixed-N) ensemble with free endpoints …

[引用][C] The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk

N MADRAS, AD SOKAL - Journal of statistical physics, 1988 - pascal-francis.inist.fr
The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk CNRS Inist
Pascal-Francis CNRS Pascal and Francis Bibliographic Databases Simple search Advanced …

[引用][C] The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk

N Madras, AD Sokal - Journal of Statistical Physics, 1988 - cir.nii.ac.jp
The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk | CiNii
Research CiNii 国立情報学研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ …

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

N Madras, AD Sokal - Journal of Statistical Physics, 1988 - nyuscholars.nyu.edu
The pivot algorithm is a dynamic Monte Carlo algorithm, first invented by Lal, which
generates self-avoiding walks (SAWs) in a canonical (fixed-N) ensemble with free endpoints …

[引用][C] The pivot algorithm: A highly efficient Monte Carlo method for the self-avoiding walk

N Madras, AD Sokal - Journal of Statistical Physics, 1988 - Springer

[引用][C] The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk

N MADRAS, AD SOKAL - Journal of statistical physics, 1988 - Springer