Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
Statistical Mechanics
2007-05-23 v2
Abstract
We present a dynamic nonlocal hybrid Monte Carlo algorithm consisting of pivot and ``cut-and-permute'' moves. The algorithm is suitable for the study of polymers in semiconfined geometries at the ordinary transition, where the pivot algorithm exhibits quasi-ergodic problems. The dynamic properties of the proposed algorithm are studied in d = 3. The hybrid dynamics is ergodic and exhibits the same optimal critical behavior as the pivot algorithm in the bulk.
Cite
@article{arxiv.cond-mat/0103415,
title = {Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces},
author = {Maria Serena Causo},
journal= {arXiv preprint arXiv:cond-mat/0103415},
year = {2007}
}
Comments
36 pages, 4 figures