Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm

DOI10.1016/J.CPC.2020.107414zbMath1525.82027arXiv1904.11191MaRDI QIDQ6040082

Stefan Schnabel, Wolfhard Janke

Publication date: 24 May 2023

Published in: Computer Physics Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.11191

zbMATH Keywords

Monte Carlopolymerself-avoiding walkMetropolis

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Monte Carlo methods applied to problems in statistical mechanics (82M31)

Cites Work

• Advanced multicanonical Monte Carlo methods for efficient simulations of nucleation processes of polymers
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.
• Exact enumeration of self-avoiding walks
• Equation of State Calculations by Fast Computing Machines
• Efficient implementation of the Pivot algorithm for self-avoiding walks

This page was built for publication: Accelerating polymer simulation by means of tree data-structures and a parsimonious Metropolis algorithm