Computes, from the generator \(Q\) of a continuous time Markov chain, the transition matrix of its embedded (jump) chain: the probability of jumping from \(i\) to \(j \ne i\) is \(-Q_{ij} / Q_{ii}\).
Value
The transition matrix of the embedded chain, with the dimnames of
gen. A state with zero exit rate (absorbing) gets probability 1 of
staying where it is.
References
Anderson, D. F. (2013). Introduction to Stochastic Processes with Applications in the Biosciences. University of Wisconsin at Madison.
See also
Other continuous time Markov chains:
ExpectedTime(),
ctmcFit(),
freq2Generator(),
impreciseProbabilityatT(),
is.CTMCirreducible(),
is.TimeReversible(),
probabilityatT(),
rctmc(),
transition2Generator()