An Efficient Algorithm to Estimate the Potential Barrier Height from Noise-Induced Escape Time Data

Author:

Bódai TamásORCID

Abstract

AbstractAn algorithm is developed for determining the potential barrier height experimentally, provided that we have control over the noise strength $$\sigma $$ σ . We are concerned with the situation when the laboratory or numerical experiment requires large resources of time or computational power, respectively, and wish to find a protocol that provides the best estimate in a given amount of time. The optimal noise strength $$\sigma ^*$$ σ to use is found to be very simply related to the potential barrier height $$\Delta \Phi $$ Δ Φ as: $$y^*=\Delta \Phi ^{-1}$$ y = Δ Φ - 1 , $$y=\sigma ^{-2}-\sigma ^{-2}_\mathrm{a}$$ y = σ - 2 - σ a - 2 , with some “anchor point” $$\sigma ^{-2}_\mathrm{a}$$ σ a - 2 ; and, as a second ingredient, an iterative method is proposed for the estimation. For a numerical verification of the optimality, we apply the algorithm to a simple system of an over-damped particle confined to a double-well potential, when it is feasible to evaluate statistics of the estimator. Subsequently, we also apply it to a high-dimensional case of a diffusive energy balance model, when the potential barrier height—concerning e.g. the warm-to-snowball-climate transition—cannot be determined analytically, but we would have to resort to more sophisticated numerical methods.

Funder

H2020 Societal Challenges

Institute for Basic Science

Publisher

Springer Science and Business Media LLC

Subject

Mathematical Physics,Statistical and Nonlinear Physics

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3