Encyclosphere.org ENCYCLOREADER
  supported by EncyclosphereKSF

Matrix of transition probabilities

From Encyclopedia of Mathematics - Reading time: 1 min


The matrix Pt=pij(t) of transition probabilities in time t for a homogeneous Markov chain ξ(t) with at most a countable set of states S:

pij(t)=P{ξ(t)=jξ(0)=i},  i,jS.

The matrices pij(t) of a Markov chain with discrete time or a regular Markov chain with continuous time satisfy the following conditions for any t>0 and i,jS:

pij(t)0,  jSpij(t)=1,

i.e. they are stochastic matrices (cf. Stochastic matrix), while for irregular chains

pij(t)0,  jSpij(t)1,

such matrices are called sub-stochastic.

By virtue of the basic (Chapman–Kolmogorov) property of a homogeneous Markov chain,

pij(s+t)=kSpik(s)pkj(t),

the family of matrices {Pt:t>0} forms a multiplicative semi-group; if the time is discrete, this semi-group is uniquely determined by P1.

References[edit]

[a1] K.L. Chung, "Elementary probability theory with stochastic processes" , Springer (1974)

How to Cite This Entry: Matrix of transition probabilities (Encyclopedia of Mathematics) | Licensed under CC BY-SA 3.0. Source: https://encyclopediaofmath.org/wiki/Matrix_of_transition_probabilities
1 |
↧ Download this article as ZWI file
Encyclosphere.org EncycloReader is supported by the EncyclosphereKSF