首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Nonergodicity of local,length-conserving Monte Carlo algorithms for the self-avoiding walk
Authors:Neal Madras  Alan D Sokal
Institution:(1) Department of Mathematics, University of Toronto, M5S 1A1 Toronto, Canada;(2) Department of Physics, New York University, 10003 New York, New York
Abstract:It is proved that every dynamic Monte Carlo algorithm for the self-avoiding walk based on a finite repertoire of local,N-conserving elementary moves is nonergodic (hereN is the number of bonds in the walk). Indeed, for largeN, each ergodic class forms an exponentially small fraction of the whole space. This invalidates (at least in principle) the use of the Verdier-Stockmayer algorithm and its generalizations for high-precision Monte Carlo studies of the self-avoiding walk.
Keywords:Self-avoiding walk  polymer  Monte Carlo  algorithm  lattice model  ergodicity  Verdier-Stockmayer
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号