New Monte Carlo algorithms for interacting self-avoiding walks
From MaRDI portal
Recommendations
- Monte Carlo methods for the self-avoiding walk
- A Monte Carlo study of non-trapped self-avoiding walks
- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- scientific article; zbMATH DE number 1560260
- Monte Carlo study of the interacting self-avoiding walk model in three dimensions.
- Scale-free Monte Carlo method for calculating the critical exponent \(\gamma\) of self-avoiding walks
- Canonical Monte Carlo determination of the connective constant of self-avoiding walks
- Statistical analysis and Monte Carlo simulation of growing self-avoiding walks on percolation
- Grand canonical simulations of the interacting self-avoiding walk model
- The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
Cited in
(11)- Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
- A nonlocal Monte Carlo algorithm for lattice trees
- Monte Carlo study of the interacting self-avoiding walk model in three dimensions.
- Monte Carlo studies of three-dimensional two-step restricted self-avoiding walks
- Monte Carlo methods for the self-avoiding walk
- Self-testing algorithms for self-avoiding walks
- Geometrical properties of interior segments of two-dimensional lattice polymer confined in a square box
- Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm
- A faster implementation of the pivot algorithm for self-avoiding walks
- Bilocal dynamics for self-avoiding walks
- Phase transitions of single semistiff polymer chains
This page was built for publication: New Monte Carlo algorithms for interacting self-avoiding walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4783698)
