We describe state-reduction algorithms for the analysis of first-passage processes in discrete- and continuous-time 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 ...
This dissertation presents a theoretical study of arbitrary discretizations of general nonequilibriu...
We present a comprehensive theory for analysis and understanding of transition events between an ini...
AbstractWe discuss the State Reduction/GTH (Grassmann, Taksar, Heyman) algorithm for recursively fin...
The graph transformation (GT) algorithm robustly computes the mean first-passage time to an absorbin...
Finite Markov chains are probabilistic network models that are commonly used as representations of d...
The transition mechanism of jump processes between two different subsets in state space reveals impo...
International audienceMarkov chains can accurately model the state-to-state dynamics of a wide range...
Abstract. We present a formalism to describe slowly decaying systems in the context of finite Markov...
International audienceConsider a sequence (η N (t) : t ≥ 0) of continuous-time, irreducible Markov c...
Abstract. The effective application of Markov chains has been paid much attention, and it has raised...
We consider Metropolis Markov chains with finite state space and transition probabilities of the for...
We consider Metropolis Markov chains with finite state space and transition probabilities of the for...
doi:10.1088/1742-5468/2006/08/P08013 Abstract. We present a formalism for describing slowly decaying...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
The problem of flickering trajectories in standard kinetic Monte Carlo (kMC) simulations prohibits s...
This dissertation presents a theoretical study of arbitrary discretizations of general nonequilibriu...
We present a comprehensive theory for analysis and understanding of transition events between an ini...
AbstractWe discuss the State Reduction/GTH (Grassmann, Taksar, Heyman) algorithm for recursively fin...
The graph transformation (GT) algorithm robustly computes the mean first-passage time to an absorbin...
Finite Markov chains are probabilistic network models that are commonly used as representations of d...
The transition mechanism of jump processes between two different subsets in state space reveals impo...
International audienceMarkov chains can accurately model the state-to-state dynamics of a wide range...
Abstract. We present a formalism to describe slowly decaying systems in the context of finite Markov...
International audienceConsider a sequence (η N (t) : t ≥ 0) of continuous-time, irreducible Markov c...
Abstract. The effective application of Markov chains has been paid much attention, and it has raised...
We consider Metropolis Markov chains with finite state space and transition probabilities of the for...
We consider Metropolis Markov chains with finite state space and transition probabilities of the for...
doi:10.1088/1742-5468/2006/08/P08013 Abstract. We present a formalism for describing slowly decaying...
This article describes an accurate procedure for computing the mean first passage times of a finite ...
The problem of flickering trajectories in standard kinetic Monte Carlo (kMC) simulations prohibits s...
This dissertation presents a theoretical study of arbitrary discretizations of general nonequilibriu...
We present a comprehensive theory for analysis and understanding of transition events between an ini...
AbstractWe discuss the State Reduction/GTH (Grassmann, Taksar, Heyman) algorithm for recursively fin...