NONLOCAL MONTE-CARLO ALGORITHM FOR SELF-AVOIDING WALKS WITH FIXED END-POINTS

被引：49

作者：

CARACCIOLO, S

PELISSETTO, A

SOKAL, AD

机构：

[1] IST NAZL FIS NUCL,PISA,ITALY

[2] NYU,DEPT PHYS,NEW YORK,NY 10003

来源：

JOURNAL OF STATISTICAL PHYSICS | 1990年 / 60卷 / 1-2期

关键词：

BFACF algorithm; critical exponent; cut-and-paste; Monte Carlo; pivot algorithm; polymer; Self-avoiding walk;

D O I：

10.1007/BF01013668

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

We study a new Monte Carlo algorithm for generating self-avoiding walks with variable length (controlled by a fugacity β) and fixed endpoints. The algorithm is a hybrid of local (BFACF) and nonlocal (cut-and-paste) moves. We find that the critical slowing-down, measured in units of computer time, is reduced compared to the pure BFACF algorithm:τCPU∼ 〈N〉≈2.3 versus 〈N〉≈3.0. We also prove some rigorous bounds on the autocorrelation time for these and related Monte Carlo algorithms. © 1990 Plenum Publishing Corporation.

引用

页码：1 / 53

页数：53

共 72 条

[61]

Sidak Z., 1964, CZECH MATH J, V14, P438

[62] CONVERGENCE OF SELF-AVOIDING RANDOM-WALK TO BROWNIAN-MOTION IN HIGH DIMENSIONS [J].