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
关键词
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 条
[1]   SERIES AND PARALLEL ADDITION OF MATRICES [J].
ANDERSON, WN ;
DUFFIN, RJ .
JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1969, 26 (03) :576-&
[2]  
ANDERSON WN, 1975, SIAM J APPL MATH, V28, P60
[3]  
[Anonymous], 1966, PHYSICS, DOI DOI 10.1103/PHYSICSPHYSIQUEFIZIKA.2.263
[4]  
[Anonymous], 1966, PERTURBATION THEORY
[5]  
[Anonymous], [No title captured]
[6]  
[Anonymous], ADV CHEM PHYS
[7]  
BARDEEN WA, 1989, NUCL PHYS B, V9, P525
[8]  
Bellman R., 1968, LINEAR ALGEBRA APPL, V1, P321
[9]   RANDOM-PATHS AND RANDOM SURFACES ON A DIGITAL-COMPUTER [J].
BERG, B ;
FOERSTER, D .
PHYSICS LETTERS B, 1981, 106 (04) :323-326
[10]   DYNAMIC CRITICAL EXPONENT OF SOME MONTE-CARLO ALGORITHMS FOR THE SELF-AVOIDING WALK [J].
CARACCIOLO, S ;
SOKAL, AD .
JOURNAL OF PHYSICS A-MATHEMATICAL AND GENERAL, 1986, 19 (13) :L797-L805