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

2001/03/20 by Maria Serena Causo, Causo, Maria Serena
Mathematics · Physics and Astronomy · #FOS: Physical sciences #Markov Chains and Monte Carlo Methods #Mathematical Approximation and Integration #Statistical Mechanics (cond-mat.stat-mech) #Stochastic processes and statistical mechanics #cond-mat.stat-mech

paper · pdf · doi:10.48550/arxiv.cond-mat/0103415

36 pages, 4 figures

openalex publication_date 2001/03/20 · arxiv created 2002/04/05 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Nonreversible Markov chain Monte Carlo algorithm for efficient generation of Self-Avoiding Walks
• A faster implementation of the pivot algorithm for self-avoiding walks
• Bilocal Dynamics for Self-Avoiding Walks
• A new monte carlo algorithm for growing compact Self Avoiding Walks
• On Self-Avoiding Walks across n-Dimensional Dice and Combinatorial Optimization: An Introduction