Narayan Brajesh, Elber Ron
Oden Institute for Computational Engineering and Science, University of Texas at Austin, Austin, Texas 78712, United States.
J Phys Chem B. 2024 Feb 15;128(6):1438-1447. doi: 10.1021/acs.jpcb.3c07933. Epub 2024 Feb 5.
The Milestoning algorithm is a method for long-time molecular dynamics simulations. It enables the sampling of rare events. The precise calculations of observables depend on accurately determining the first hitting point distribution (FHPD) for each milestone. There is no analytical expression for FHPD, which is estimated numerically. Several variants of Milestoning offer approximations to the FHPD. Here, we examine in detail the FHPD of an exact calculation and Milestoning variants. We also introduce a new version of the Milestoning algorithm, buffer Milestoning, with a comparable cost to conventional Milestoning but higher accuracy. We use the mean first passage time and the free energy to assess the simulation quality, and we compare the accuracy and efficiency of buffer Milestoning to exact calculations, conventional Milestoning, local-passage-time-weighted Milestoning, Markovian Milestoning with Voronoi tessellation, and exact Milestoning. Conventional Milestoning requires milestone decorrelation. If this condition is not satisfied, it is the least accurate approach of all the techniques we examined. We conclude that for a small increase in cost compared to conventional Milestoning, buffer Milestoning provides accurate results for a range of problems, including more correlated milestones and is, therefore, versatile compared to other variants. Local-passage-time-weighted Milestoning provides accuracy similar to that of buffer Milestoning but at an increased simulation cost. Markovian Milestoning with Voronoi tessellation is the most accurate compared with other approximations, but it is less stable for high barriers and more expensive.
里程碑算法是一种用于长时间分子动力学模拟的方法。它能够对罕见事件进行采样。可观测量的精确计算取决于准确确定每个里程碑的首次命中点分布(FHPD)。FHPD没有解析表达式,而是通过数值估计得到。里程碑算法的几种变体提供了对FHPD的近似值。在这里,我们详细研究了精确计算和里程碑算法变体的FHPD。我们还引入了一种新版本的里程碑算法——缓冲里程碑算法,其成本与传统里程碑算法相当,但精度更高。我们使用平均首次通过时间和自由能来评估模拟质量,并将缓冲里程碑算法的精度和效率与精确计算、传统里程碑算法、局部通过时间加权里程碑算法、带Voronoi镶嵌的马尔可夫里程碑算法以及精确里程碑算法进行比较。传统里程碑算法需要里程碑去相关。如果不满足这个条件,它就是我们所研究的所有技术中最不准确的方法。我们得出结论,与传统里程碑算法相比,缓冲里程碑算法虽然成本略有增加,但对于一系列问题都能提供准确的结果,包括相关性更强的里程碑,因此与其他变体相比具有通用性。局部通过时间加权里程碑算法提供的精度与缓冲里程碑算法相似,但模拟成本更高。与其他近似方法相比,带Voronoi镶嵌的马尔可夫里程碑算法最准确,但对于高势垒情况不太稳定且成本更高。