本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2023-03-10
摘要
We first derive the Hamilton-Jacobi theory underlying continuous-time 馬可夫 processes, and then we use the construction to develop a variational algorithm for estimating escape (least improbable or first passage) paths for a generic 隨機 chemical reaction 網絡 that exhibits multiple fixed points. The design of our algorithm is such that it is independent of the underlying dimensionality of the system, the discretization control parameters are updated toward the continuum limit, and there is an easy-to-calculate measure for the correctness of its solution. We consider several applications of the algorithm and verify them against 計算ly expensive means such as the shooting method and 隨機 simulation. While we employ theoretical techniques from 數學 physics, numerical optimization and chemical reaction 網
※ 此為已發表論文，全文需透過期刊付費取得