MONTE-CARLO GENERATION OF SELF-AVOIDING WALKS WITH FIXED ENDPOINTS AND FIXED LENGTH

被引:81
作者
MADRAS, N [1 ]
ORLITSKY, A [1 ]
SHEPP, LA [1 ]
机构
[1] AT&T BELL LABS,MURRAY HILL,NJ 07974
关键词
ergodicity; Monte Carlo; pivot algorithm; self-avoiding polygon; Self-avoiding walk;
D O I
10.1007/BF01020290
中图分类号
O4 [物理学];
学科分类号
0702 ;
摘要
We propose a new class of dynamic Monte Carlo algorithms for generating self-avoiding walks uniformly from the ensemble with fixed endpoints and fixed length in any dimension, and prove that these algorithms are ergodic in all cases. We also prove the ergodicity of a variant of the pivot algorithm. © 1990 Plenum Publishing Corporation.
引用
收藏
页码:159 / 183
页数:25
相关论文
共 16 条