- 1、本文档共28页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Kinetic Analysis of Discrete Path Sampling Stationary Point Databases
a
r
X
i
v
:
c
o
n
d
-
m
a
t
/
0
6
0
4
1
6
5
v
1
[
c
o
n
d
-
m
a
t
.s
o
f
t
]
6
A
p
r
2
0
0
6
Kinetic Analysis of Discrete Path Sampling
Stationary Point Databases
Semen A. Trygubenko? and David J. Wales?
University Chemical Laboratories, Lensfield Road,
Cambridge CB2 1EW, UK
February 6, 2008
Abstract
Analysing stationary point databases to extract phenomenological rate con-
stants can become time-consuming for systems with large potential energy bar-
riers. In the present contribution we analyse several different approaches to this
problem. First, we show how the original rate constant prescription within the
discrete path sampling approach can be rewritten in terms of committor proba-
bilities. Two alternative formulations are then derived in which the steady-state
assumption for intervening minima is removed, providing both a more accurate
kinetic analysis, and a measure of whether a two-state description is appropri-
ate. The first approach involves running additional short kinetic Monte Carlo
(KMC) trajectories, which are used to calculate waiting times. Here we in-
troduce ‘leapfrog’ moves to second-neighbour minima, which prevent the KMC
trajectory oscillating between structures separated by low barriers. In the second
approach we successively remove minima from the intervening set, renormalising
?E-mail: sat39@cam.ac.uk
?E-mail: dw34@cam.ac.uk
1
the branching probabilities and waiting times to preserve the mean first-passage
times of interest. Regrouping the local minima appropriately is also shown to
speed up the kinetic analysis dramatically at low temperatures. Applications are
described where rates are extracted for databases containing tens of thousands
of stationary points, with effective barriers that are several hundred times kBT .
1 Introduction
A great deal of effort is currently focused on the development of new methods to treat
‘rare events’. A number of these methods employ a coarse-graining approximation
of some kind to the phase space.1
您可能关注的文档
- HSPICE 实战手册.pdf
- How to use RSS to track literature.ppt
- HSP高并发之监控平台1.0.pdf
- HT2801规格书新.pdf
- HSU2025 使用手册 Rev 2011-05-25.pdf
- HTML5.Canvas.教程.pdf
- Html5培训课程中主要学习的几个js类型.pdf
- human cortical bone.pdf
- HullOFOD9eSolutionsCh01第九版期权期货及其他衍生品课后答案.pdf
- Hubs, Nodes, and Bypassed Places A Typology of E-commerce Regions in the United States.pdf
- 2025年广西中考地理二轮复习:专题四+人地协调观+课件.pptx
- 2025年广西中考地理二轮复习:专题三+综合思维+课件.pptx
- 2025年中考地理一轮教材梳理:第4讲+天气与气候.pptx
- 第5讲+世界的居民课件+2025年中考地理一轮教材梳理(商务星球版).pptx
- 冀教版一年级上册数学精品教学课件 第1单元 熟悉的数与加减法 1.1.6 认识1-9 第6课时 合与分.ppt
- 2025年中考一轮道德与法治复习课件:坚持宪法至上.pptx
- 2025年河北省中考一轮道德与法治复习课件:崇尚法治精神.pptx
- 八年级下册第二单元+理解权利义务+课件-2025年吉林省中考道德与法治一轮复习.pptx
- 精品解析:湖南省娄底市2019-2020学年八年级(上)期中考试物理试题(原卷版).doc
- 2025年中考地理一轮教材梳理:第10讲+中国的疆域与人口.pptx
文档评论(0)