Transition-rate matrix

In probability theory, a transition-rate matrix (also known as a Q-matrix,[1] intensity matrix,[2] or infinitesimal generator matrix[3]) is an array of numbers describing the instantaneous rate at which a continuous-time Markov chain transitions between states.

In a transition-rate matrix (sometimes written [4]), element (for ) denotes the rate departing from and arriving in state . The rates , and the diagonal elements are defined such that

,

and therefore the rows of the matrix sum to zero.

Up to a global sign, a large class of examples of such matrices is provided by the Laplacian of a directed, weighted graph. The vertices of the graph correspond to the Markov chain's states.

  1. ^ Suhov & Kelbert 2008, Definition 2.1.1.
  2. ^ Asmussen, S. R. (2003). "Markov Jump Processes". Applied Probability and Queues. Stochastic Modelling and Applied Probability. Vol. 51. pp. 39–59. doi:10.1007/0-387-21525-5_2. ISBN 978-0-387-00211-8.
  3. ^ Trivedi, K. S.; Kulkarni, V. G. (1993). "FSPNs: Fluid stochastic Petri nets". Application and Theory of Petri Nets 1993. Lecture Notes in Computer Science. Vol. 691. p. 24. doi:10.1007/3-540-56863-8_38. ISBN 978-3-540-56863-6.
  4. ^ Rubino, Gerardo; Sericola, Bruno (1989). "Sojourn Times in Finite Markov Processes" (PDF). Journal of Applied Probability. 26 (4). Applied Probability Trust: 744–756. doi:10.2307/3214379. JSTOR 3214379. S2CID 54623773.