Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces

Details Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces

2001-03-20

arxiv.org/abs/cond-mat/0103415v2

Physics

Condensed Matter

Statistical Mechanics

36 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1585