Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
| dc.creator | Causo, Maria Serena | |
| dc.date | 2001-03-20 | |
| dc.date | 2002-04-05 | |
| dc.date.accessioned | 2026-07-07T02:40:47Z | |
| dc.date.available | 2026-07-07T02:40:47Z | |
| dc.description | 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. | |
| dc.description | 36 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/cond-mat/0103415 | |
| dc.identifier | http://arxiv.org/abs/cond-mat/0103415 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/17502 | |
| dc.subject | Statistical Mechanics | |
| dc.title | Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces | |
| dc.type | text |