We present a comprehensive theory for analysis and understanding of transition events between an initial set A and a target set B for general ergodic finite-state space Markov chains or jump processes, including random walks on networks as they occur, e.g., in Markov State Modelling in molecular dynamics. The theory allows us to decompose the probability flow generated by transition events between the sets A and B into the productive part that directly flows from A to B through reaction pathways and the unproductive part that runs in loops and is supported on cycles of the underlying network. It applies to random walks on directed networks and nonreversible Markov processes and can be seen as an extension of Transition Path Theory. Inform...
Stochastic networks a.k.a. Markov chains allow us to model phenomena in systems arising in many appl...
M.Sc. (Mathematics)In chapter 1, we give the reader some background concerning digraphs that are use...
We consider random walks on dynamical networks where edges appear and disappear during finite time i...
We present a comprehensive theory for analysis and understanding of transition events between an ini...
The framework of transition path theory (TPT) is developed in the context of continuous-time Markov...
Finite Markov chains are probabilistic network models that are commonly used as representations of d...
We construct a statistical theory of reactive trajectories between two pre-specified sets A and B, i...
We begin by defining the concept of `open' Markov processes, which are continuous-time Markov chains...
Nonequilibrium steady states of Markov processes give rise to nontrivial cyclic probability fluxes. ...
We describe state-reduction algorithms for the analysis of first-passage processes in discrete- and ...
The graph transformation (GT) algorithm robustly computes the mean first-passage time to an absorbin...
Reaction networks are commonly used to model the dynamics of populations subject to transformations ...
Reaction networks are commonly used to model the dynamics of populations subject to transformations ...
By using the cycle representation theory of Markov processes, we investigate proper criterions regar...
The transition mechanism of jump processes between two different subsets in state space reveals impo...
Stochastic networks a.k.a. Markov chains allow us to model phenomena in systems arising in many appl...
M.Sc. (Mathematics)In chapter 1, we give the reader some background concerning digraphs that are use...
We consider random walks on dynamical networks where edges appear and disappear during finite time i...
We present a comprehensive theory for analysis and understanding of transition events between an ini...
The framework of transition path theory (TPT) is developed in the context of continuous-time Markov...
Finite Markov chains are probabilistic network models that are commonly used as representations of d...
We construct a statistical theory of reactive trajectories between two pre-specified sets A and B, i...
We begin by defining the concept of `open' Markov processes, which are continuous-time Markov chains...
Nonequilibrium steady states of Markov processes give rise to nontrivial cyclic probability fluxes. ...
We describe state-reduction algorithms for the analysis of first-passage processes in discrete- and ...
The graph transformation (GT) algorithm robustly computes the mean first-passage time to an absorbin...
Reaction networks are commonly used to model the dynamics of populations subject to transformations ...
Reaction networks are commonly used to model the dynamics of populations subject to transformations ...
By using the cycle representation theory of Markov processes, we investigate proper criterions regar...
The transition mechanism of jump processes between two different subsets in state space reveals impo...
Stochastic networks a.k.a. Markov chains allow us to model phenomena in systems arising in many appl...
M.Sc. (Mathematics)In chapter 1, we give the reader some background concerning digraphs that are use...
We consider random walks on dynamical networks where edges appear and disappear during finite time i...