Abstract
Discusses the dynamic critical behavior of some Monte Carlo algorithms for the self-avoiding walk (SAW). For algorithms with local N-conserving elementary moves, it is argued that the autocorrelation time behaves as tau approximately Np with p approximately=2+2 nu . For the BFACF dynamics (a grand canonical algorithm), Monte Carlo data is presented indicating that p=2.2+or-0.5 for two-dimensional non-reversal random walks and p=3.0+or-0.4 for two-dimensional SAW, values which are significantly less than 2+2 nu .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
