Jump to content

Uniformization (probability theory)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gareth Jones (talk | contribs) at 14:56, 15 December 2011 (+ finite state requirement). 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 compute transient solutions of finite state continuous-time Markov chains. The method involves the constructions of an analgous discrete time Markov chain,[2] where transitions occur according to an exponential distribution with the same parameter in every state. This parameter, γ, is the same in all states hence the name uniformisation. The method is simple to program and efficiently calculates an approximation to the transient distribution at a single point in time (near zero).[1]

Method description

For a continuous time Markov chain with transition rate matrix Q, the uniformized discrete time Markov chain has probability transition matrix P is defined to be[1][3][4]

with γ, the uniform rate parameter, chosen such that

For a starting distribution π(0), the transient distribution at time t, π(t) is computed by[1]

In practice this series is terminated after finitely many terms.

Notes

  1. ^ a b c d 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.