Numerical analysis of first-passage processes in finite Markov chains exhibiting metastability

被引:9
|
作者
Sharpe, Daniel J. [1 ]
Wales, David J. [1 ]
机构
[1] Univ Cambridge, Dept Chem, Lensfield Rd, Cambridge CB2 1EW, England
基金
英国工程与自然科学研究理事会;
关键词
1ST PASSAGE TIMES; TRANSITION-PATH THEORY; STATIONARY DISTRIBUTIONS; FUNDAMENTAL MATRIX; STATE MODELS; STOCHASTIC MATRICES; ERROR ANALYSIS; SENSITIVITY; COMPUTATION; ALGORITHM;
D O I
10.1103/PhysRevE.104.015301
中图分类号
O35 [流体力学]; O53 [等离子体物理学];
学科分类号
070204 ; 080103 ; 080704 ;
摘要
We describe state-reduction algorithms for the analysis of first-passage processes in discrete- and continuoustime finite Markov chains. We present a formulation of the graph transformation algorithm that allows for the evaluation of exact mean first-passage times, stationary probabilities, and committor probabilities for all nonabsorbing nodes of a Markov chain in a single computation. Calculation of the committor probabilities within the state-reduction formalism is readily generalizable to the first hitting problem for any number of alternative target states. We then show that a state-reduction algorithm can be formulated to compute the expected number of times that each node is visited along a first-passage path. Hence, all properties required to analyze the first-passage path ensemble (FPPE) at both a microscopic and macroscopic level of detail, including the mean and variance of the first-passage time distribution, can be computed using state-reduction methods. In particular, we derive expressions for the probability that a node is visited along a direct transition path, which proceeds without returning to the initial state, considering both the nonequilibrium and equilibrium (steady-state) FPPEs. The reactive visitation probability provides a rigorous metric to quantify the dynamical importance of a node for the productive transition between two endpoint states and thus allows the local states that facilitate the dominant transition mechanisms to be readily identified. The state-reduction procedures remain numerically stable even for Markov chains exhibiting metastability, which can be severely ill-conditioned. The rare event regime is frequently encountered in realistic models of dynamical processes, and our methodology therefore provides valuable tools for the analysis of Markov chains in practical applications. We illustrate our approach with numerical results for a kinetic network representing a structural transition in an atomic cluster.
引用
收藏
页数:17
相关论文
共 7 条
  • [1] The first-passage times of phase semi-Markov processes
    Zhang, Xuan
    Hou, Zhenting
    STATISTICS & PROBABILITY LETTERS, 2012, 82 (01) : 40 - 48
  • [2] Simple procedures for finding mean first passage times in Markov chains
    Hunter, Jeffrey J.
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2007, 24 (06) : 813 - 829
  • [3] An iterative algorithm for computing mean first passage times of Markov chains
    Xu, Jianhong
    APPLIED MATHEMATICS AND COMPUTATION, 2015, 250 : 372 - 389
  • [4] First-passage time analysis of diffusion-controlled reactions in single-molecule detection
    Lyu, Yingkai
    An, Lixiang
    Zeng, Huaiyang
    Zheng, Feng
    Guo, Jiajia
    Zhang, Pengcheng
    Yang, Hui
    Li, Hao
    TALANTA, 2023, 260
  • [5] Statistical Analysis of the First Passage Path Ensemble of Jump Processes
    von Kleist, Max
    Schutte, Christof
    Zhang, Wei
    JOURNAL OF STATISTICAL PHYSICS, 2018, 170 (04) : 809 - 843
  • [6] Statistical Analysis of the First Passage Path Ensemble of Jump Processes
    Max von Kleist
    Christof Schütte
    Wei Zhang
    Journal of Statistical Physics, 2018, 170 : 809 - 843
  • [7] First passage times of two-dimensional correlated processes: Analytical results for the Wiener process and a numerical method for diffusion processes
    Sacerdote, Laura
    Tamborrino, Massimiliano
    Zucca, Cristina
    JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2016, 296 : 275 - 292