• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

一种用于计算具有跳跃的随机动力系统最可能转移路径的最优控制方法。

An optimal control method to compute the most likely transition path for stochastic dynamical systems with jumps.

作者信息

Wei Wei, Gao Ting, Chen Xiaoli, Duan Jinqiao

机构信息

Center for Mathematical Sciences, Huazhong University of Science and Technology, Wuhan, Hubei 430074, China.

Department of Mathematics, National University of Singapore, Singapore 119077, Singapore.

出版信息

Chaos. 2022 May;32(5):051102. doi: 10.1063/5.0093924.

DOI:10.1063/5.0093924
PMID:35649976
Abstract

Many complex real world phenomena exhibit abrupt, intermittent, or jumping behaviors, which are more suitable to be described by stochastic differential equations under non-Gaussian Lévy noise. Among these complex phenomena, the most likely transition paths between metastable states are important since these rare events may have a high impact in certain scenarios. Based on the large deviation principle, the most likely transition path could be treated as the minimizer of the rate function upon paths that connect two points. One of the challenges to calculate the most likely transition path for stochastic dynamical systems under non-Gaussian Lévy noise is that the associated rate function cannot be explicitly expressed by paths. For this reason, we formulate an optimal control problem to obtain the optimal state as the most likely transition path. We then develop a neural network method to solve this issue. Several experiments are investigated for both Gaussian and non-Gaussian cases.

摘要

许多复杂的现实世界现象表现出突然、间歇或跳跃行为,在非高斯 Lévy 噪声下,这些行为更适合用随机微分方程来描述。在这些复杂现象中,亚稳态之间最可能的转变路径很重要,因为这些罕见事件在某些情况下可能会产生很大影响。基于大偏差原理,最可能的转变路径可以被视为连接两点的路径上速率函数的最小值。计算非高斯 Lévy 噪声下随机动力系统最可能转变路径的挑战之一是,相关的速率函数不能通过路径明确表示。因此,我们制定了一个最优控制问题,以获得作为最可能转变路径的最优状态。然后,我们开发了一种神经网络方法来解决这个问题。针对高斯和非高斯情况都进行了几项实验。

相似文献

1
An optimal control method to compute the most likely transition path for stochastic dynamical systems with jumps.一种用于计算具有跳跃的随机动力系统最可能转移路径的最优控制方法。
Chaos. 2022 May;32(5):051102. doi: 10.1063/5.0093924.
2
Machine learning framework for computing the most probable paths of stochastic dynamical systems.用于计算随机动力系统最可能路径的机器学习框架。
Phys Rev E. 2021 Jan;103(1-1):012124. doi: 10.1103/PhysRevE.103.012124.
3
Most probable dynamics of stochastic dynamical systems with exponentially light jump fluctuations.具有指数型轻跳涨落的随机动力系统的最概然动力学
Chaos. 2020 Jun;30(6):063142. doi: 10.1063/5.0006292.
4
Discovering transition phenomena from data of stochastic dynamical systems with Lévy noise.从具有 Lévy 噪声的随机动力系统数据中发现转变现象。
Chaos. 2020 Sep;30(9):093110. doi: 10.1063/5.0004450.
5
Optimal transition paths of stochastic chemical kinetic systems.随机化学动力学系统的最优转移路径
J Chem Phys. 2006 Apr 28;124(16):164104. doi: 10.1063/1.2191487.
6
Exponential increase of transition rates in metastable systems driven by non-Gaussian noise.非高斯噪声驱动下亚稳态系统中转移速率的指数增长。
Sci Rep. 2023 Mar 8;13(1):3853. doi: 10.1038/s41598-023-30577-0.
7
Detecting the maximum likelihood transition path from data of stochastic dynamical systems.从随机动力系统的数据中检测最大似然转移路径。
Chaos. 2020 Nov;30(11):113124. doi: 10.1063/5.0012858.
8
Transition pathways for a class of high dimensional stochastic dynamical systems with Lévy noise.一类具有 Lévy 噪声的高维随机动力系统的转移路径
Chaos. 2021 Jun;31(6):063138. doi: 10.1063/5.0050128.
9
Path-integral methods for analyzing the effects of fluctuations in stochastic hybrid neural networks.用于分析随机混合神经网络中波动影响的路径积分方法。
J Math Neurosci. 2015 Feb 27;5:4. doi: 10.1186/s13408-014-0016-z. eCollection 2015.
10
An end-to-end deep learning approach for extracting stochastic dynamical systems with α-stable Lévy noise.一种用于提取具有α稳定 Lévy 噪声的随机动力系统的端到端深度学习方法。
Chaos. 2022 Jun;32(6):063112. doi: 10.1063/5.0089832.