Cut-and-permute algorithm for self-avoiding walks in the presence of surfaces
Maria Serena Causo
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.
Create a lesson
Related papers
Real-Space renormalization for the drawups and drawdowns of stochastic trajectories: universality classes for diffusion processes and random walks via the scale function
Cecile Monthus
Stochastic synthesis and degradation of arbitrary diffusive processes
Denis Boyer, Gabriel Mercado-Vásquez
Critical amplitudes of the Baxter-Wu model from MCPA and Wolff simulations: free-exponent and fixed-exponent fits
Vyacheslav Mozolenko, Ian Pile, Lev Shchur
Capillary Coarsening Drives Re-entrant Statistical Transitions in Early Coffee-Ring Growth
Arundas Chandradasan, Dileep Mampallil
Maximum entropy explanation for the ubiquity of power-law mechanical responses
Sverre Holm
Thermodynamic Bethe Ansatz for the Toda chain from inverse scattering transform
Alberto Brollo