Implementation and performance analysis of bridging Monte Carlo moves for off-lattice single chain polymers in globular states

Abstract

Bridging algorithms are global Monte Carlo moves which allow for an efficient sampling of single polymer chains. In this manuscript we discuss the adaptation of three bridging algorithms from lattice to continuum models, and give details on the corrections to the acceptance rules which are required to fulfill detailed balance. For the first time we are able to compare the efficiency of the moves by analyzing the occurrence of knots in globular states. For a flexible homopolymer chain of length N=1000, independent configurations can be generated up to two orders of magnitude faster than with slithering snake moves.

12 pages, 5 figures, preprint submitted to computer physics communications

References in corpus (5)

• An efficient, multiple range random walk algorithm to calculate the density of states
• Equilibration of Long Chain Polymer Melts in Computer Simulations
• Versatile approach to access the low temperature thermodynamics of lattice polymers and proteins
• Surface effects in the crystallization process of elastic flexible polymers
• Static Rouse Modes and Related Quantities: Corrections to Chain Ideality in Polymer Melts

Cited by in corpus (6)

• Polymers with spatial or topological constraints: theoretical and computational results
• Multi-GPU Accelerated Multi-Spin Monte Carlo Simulations of the 2D Ising Model
• Advanced multicanonical Monte Carlo methods for efficient simulations of nucleation processes of polymers
• Adsorption of polymers at nanowires
• Topological comparison of flexible and semiflexible chains in polymer melts with $\theta$-chains
• Self-assembly Monte Carlo reveals localized entanglement in giant polymer melts