Irreversible Markov chain Monte Carlo algorithm for self-avoiding walk

被引：11

作者：

Hu, Hao ^{[1
,2
,3
,4
]}

Chen, Xiaosong ^{[3
]}

Deng, Youjin ^{[1
,2
,3
]}

机构：

[1] Univ Sci & Technol China, Natl Lab Phys Sci Microscale, Hefei 230026, Peoples R China

[2] Univ Sci & Technol China, Dept Modern Phys, Hefei 230026, Peoples R China

[3] Chinese Acad Sci, Inst Theoret Phys, State Key Lab Theoret Phys, Beijing 100190, Peoples R China

[4] Nanyang Technol Univ, Sch Chem & Biomed Engn, Singapore 637459, Singapore

来源：

FRONTIERS OF PHYSICS | 2017年 / 12卷 / 01期

基金：

中央高校基本科研业务费专项资金资助; 中国国家自然科学基金;

关键词：

Monte Carlo algorithms; self-avoiding walk; irreversible; balance condition; SIMULATIONS; POLYMERS;

D O I：

10.1007/s11467-016-0646-6

中图分类号：

O4 [物理学];

学科分类号：

0702 ;

摘要：

We formulate an irreversible Markov chain Monte Carlo algorithm for the self-avoiding walk (SAW), which violates the detailed balance condition and satisfies the balance condition. Its performance improves significantly compared to that of the Berretti-Sokal algorithm, which is a variant of the Metropolis-Hastings method. The gained efficiency increases with spatial dimension (D), from approximately 1 0 times in 2D to approximately 4 0 times in 5D. We simulate the SAW on a 5D hyper-cubic lattice with periodic boundary conditions, for a linear system with a size up to L = 128, and confirm that as for the 5D Ising model, the finite-size scaling of the SAW is governed by renormalized exponents, nu* = 2/d and gamma/nu* = d/2. The critical point is determined, which is approximately 8 times more precise than the best available estimate.

引用

页数：8

共 50 条

[31] Computer simulation of self-avoiding walk terminally attached to wall [J].

吴大诚 ;

杜鹏 ;

康健 .

Chinese Science Bulletin, 1996, (11) :954-957

[32] The Hammersley-Welsh bound for self-avoiding walk revisited [J].

Hutchcroft, Tom .

ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2018, 23

[33] The Quenched Critical Point for Self-Avoiding Walk on Random Conductors [J].

Chino, Yuki ;

Sakai, Akira .

JOURNAL OF STATISTICAL PHYSICS, 2016, 163 (04) :754-764

[34] Monte Carlo Study of Four-Dimensional Self-avoiding Walks of up to One Billion Steps [J].

Nathan Clisby .

Journal of Statistical Physics, 2018, 172 :477-492

[35] Monte Carlo Study of Four-Dimensional Self-avoiding Walks of up to One Billion Steps [J].

Clisby, Nathan .

JOURNAL OF STATISTICAL PHYSICS, 2018, 172 (02) :477-492

[36] Scale-free Monte Carlo method for calculating the critical exponent. of self-avoiding walks [J].

Clisby, Nathan .

JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2017, 50 (26)

[37] Self-Avoiding Trail model in two-dimensional regular lattices: Study of conformational quantities and relation with the Self-Avoiding Walk model [J].

Granzotti, C. R. F. ;

Martinez, A. S. ;

da Silva, M. A. A. .

RESULTS IN PHYSICS, 2022, 33

[38] Application of the transitional Markov chain Monte Carlo algorithm to probabilistic site characterization [J].

Ching, Jianye ;

Wang, Jiun-Shiang .

ENGINEERING GEOLOGY, 2016, 203 :151-167

[39] A Lower Bound for the End-to-End Distance of the Self-Avoiding Walk [J].

Madras, Neal .

CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 2014, 57 (01) :113-118

[40] Unsolved Problems in Computational Science: III A special self-avoiding walk [J].

Gao, Shanzhen ;

Chen, Keh-Hsun .

2016 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE & COMPUTATIONAL INTELLIGENCE (CSCI), 2016, :1371-1374

← 1 2 3 4 5 →