For the finite state space , the generator or Q-matrix is defined by
Its off-diagonal entries are nonnegative jump rates and . The transition semigroup of a continuous-time Markov chain is .
An invariant distribution of a continuous-time Markov chain is a probability row vector satisfying for every . Differentiation at zero gives ; conversely, implies . Thus
Invariant distributions need not be unique: each closed communicating class supports one, and their convex combinations are invariant. A finite irreducible chain has a unique invariant distribution.
Let be the arrival times of the independent rate- Poisson process. The increments are independent exponential variables of rate . Conditional on , the Markov property, time homogeneity, and independence of the next increment give
Hence is a discrete-time Markov chain. Its transition matrix is the Poisson-sampled continuous-time Markov chain resolvent
If , then and integration gives . Conversely, if a probability row vector satisfies , multiplying
on the right by yields . Therefore the sampled chain and the original chain have exactly the same invariant distributions.
A Q-matrix satisfies for and ; on a countable state space the exit rate is required to be finite. For a finite-state continuous-time Markov chain with transition semigroup ,
The backward and forward Kolmogorov equations are respectively
Let denote the transition semigroup of a continuous-time Markov chain. The first person is observed in at day zero, at day seven, and at day fourteen, so the contribution is
For the second person, death is observed exactly at day six but the infection time is latent. The density of an transition at day six is
Thus the combined contribution is a function of . This illustrates how panel observations contribute transition probabilities while an exactly observed transition contributes a state probability times its transition intensity.