Jump to content

Uniformization (probability theory)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 132.236.181.81 (talk) at 15:50, 24 May 2011. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In probability theory, uniformization method, (also known as Jensen's method[1] or the randomization method[2]) is a method to transient solutions of continuous-time Markov chains. The word uniformization in its narrower sense involves the transformation of a continuous time Markov chain to an analgous discrete time Markov chain.[2]. This chain is then randomized, that is, the times between changes are no longer constant, but exponential. The method is simple to program and efficiently calculates the transient distribution.[1].

For a continuous time Markov chain with transition rate matrix Q, the uniformized discrete time Markov chain has probability transition matrix P calculated by[1][3][4]

with chosen such that . Randomizing the discrete-time Markov chain now results in the following formula for the solution of , the transient solution of the continuous-time Markov chain


Notes

  1. ^ a b c Stewart, William J. (2009). Probability, Markov chains, queues, and simulation: the mathematical basis of performance modeling. Princeton University Press. p. 361. ISBN 0691140626.
  2. ^ a b Ibe, Oliver C. (2009). Markov processes for stochastic modeling. Academic Press. p. 98. ISBN 0123744512.
  3. ^ Cassandras, Christos G.; Lafortune, Stéphane (2008). Introduction to discrete event systems. Springer. ISBN 0387333320.
  4. ^ Ross, Sheldon M. (2007). Introduction to probability models. Academic Press. ISBN 0125980620.