Transition Rate Matrix
Contents
Definition
A Transition Rate Matrix, also, known as the "Infinitesimal Generator" of a Transition Matrix is a square (n x n) matrix representing the transition rates of a multi-state stochastic system (e.g. a Markov Chain)[1]. It measures the probability (per unit of time) that an event (state transition) occurs within an infinitesimally small time interval.
The size n of the matrix is linked to the cardinality of the State Space that describes the system being modelled. Lets assume a state space . If the rate of moving from state m to state n in an infinititesimal time period is , the transition rate matrix is given by using as the row and column element:
Properties
- Since the transition rates are refer to the probabilities of transitions they must be positive (but need not be less than unity)
- Since a system must migrate to any of the available states (inclusive of possibly staying in the same state) the transition rate matrix must satisfy:
Equivalently to the summation property, the diagonal elements are by convention denote as
Generating a Transition Matrix
A transition rate matrix Q gives rise to a transition matrix T via:
Chapman-Kolmogorov Equation
In differential form, the evolution of transition probabilities as a function of the transition rates is given by the forward Chapman-Kolmogorov Equation:
Characterization
Transition rate matrices can vary significantly in the type of transition phenomena they capture. Some variations can be captured in well defined mathematical conditions satisfied by the matrix elements
Time Homogeneity
When the transition rates do not depend on time we have the simpler category of time homogeneous transition phenomena (which also significantly simplifies calculations)
Estimation
The empirical estimation of a transition rate matrix is via the Aalen-Johansen Estimator
References
- ↑ Encyclopedic Dictionary of Mathematics