Abstract
A graph transformation procedure is described that enables waiting times, rate constants, and committor probabilities to be calculated within a single scheme for finite-state discrete-time Markov processes. The scheme is applicable to any transition network where the states, equilibrium occupation probabilities, and transition probabilities are specified. For networks involving many states or slow overall kinetics, the deterministic graph transformation approach is faster and more accurate than direct diagonalization of the transition matrix, kinetic Monte Carlo, or iterative procedures.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
