Variant Monte Carlo algorithm for driven elastic strings in random media

DOI10.1016/J.CPC.2005.03.042zbMATH Open1196.82026arXivcond-mat/0503133OpenAlexW2161073332WikidataQ62415897 ScholiaQ62415897MaRDI QIDQ709743FDOQ709743

Authors: Alberto Rosso, Werner Krauth 

Publication date: 18 October 2010

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

Abstract: We discuss the non-local Variant Monte Carlo algorithm which has been successfully employed in the study of driven elastic strings in disordered media at the depinning threshold. Here we prove two theorems, which establish that the algorithm satisfies the crucial no-passing rule and that, after some initial time, the string exclusively moves forward. The Variant Monte Carlo algorithm overcomes the shortcomings of local methods, as we show by analyzing the depinning threshold of a single-pin problem.

Full work available at URL: https://arxiv.org/abs/cond-mat/0503133

Recommendations

• The fate of the elastic string: roughening near the depinning threshold
• Depinning of a discrete elastic string from a random array of weak pinning points with finite dimensions
• Nonlocal Monte Carlo algorithm for self-avoiding walks with fixed endpoints.
• Note on the Metropolis Monte Carlo method on random lattices
• The pivot algorithm: a highly efficient Monte Carlo method for the self-avoiding walk.

zbMATH Keywords

disorderelasticitydepinning

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to statistical mechanics (82-04) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30)

This page was built for publication: Variant Monte Carlo algorithm for driven elastic strings in random media

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709743)