Difference between revisions of "Matrix of transition probabilities"
(Importing text file) |
|||
(One intermediate revision by one other user not shown) | |||
Line 1: | Line 1: | ||
− | + | <!-- | |
+ | m0628401.png | ||
+ | $#A+1 = 13 n = 0 | ||
+ | $#C+1 = 13 : ~/encyclopedia/old_files/data/M062/M.0602840 Matrix of transition probabilities | ||
+ | Automatically converted into TeX, above some diagnostics. | ||
+ | Please remove this comment and the {{TEX|auto}} line below, | ||
+ | if TeX found to be correct. | ||
+ | --> | ||
− | + | {{TEX|auto}} | |
+ | {{TEX|done}} | ||
− | The | + | The matrix $ P _ {t} = \| p _ {ij} ( t) \| $ |
+ | of [[Transition probabilities|transition probabilities]] in time $ t $ | ||
+ | for a homogeneous [[Markov chain|Markov chain]] $ \xi ( t) $ | ||
+ | with at most a countable set of states $ S $: | ||
− | + | $$ | |
+ | p _ {ij} ( t) = {\mathsf P} \{ \xi ( t) = j \mid \xi ( 0) = i \} ,\ \ | ||
+ | i, j \in S. | ||
+ | $$ | ||
− | + | The matrices $ \| p _ {ij} ( 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, j \in S $: | ||
− | + | $$ | |
+ | p _ {ij} ( t) \geq 0,\ \ | ||
+ | \sum _ {j \in S } p _ {ij} ( t) = 1, | ||
+ | $$ | ||
+ | |||
+ | i.e. they are stochastic matrices (cf. [[Stochastic matrix]]), while for irregular chains | ||
+ | |||
+ | $$ | ||
+ | p _ {ij} ( t) \geq 0,\ \ | ||
+ | \sum _ {j \in S } p _ {ij} ( t) \leq 1, | ||
+ | $$ | ||
such matrices are called sub-stochastic. | such matrices are called sub-stochastic. | ||
Line 15: | Line 41: | ||
By virtue of the basic (Chapman–Kolmogorov) property of a homogeneous Markov chain, | By virtue of the basic (Chapman–Kolmogorov) property of a homogeneous Markov chain, | ||
− | + | $$ | |
− | + | p _ {ij} ( s+ t) = \sum _ {k \in S } p _ {ik} ( s) p _ {kj} ( t), | |
− | + | $$ | |
− | |||
− | |||
− | |||
− | |||
+ | the family of matrices $ \{ {P _ {t} } : {t > 0 } \} $ | ||
+ | forms a [[multiplicative semi-group]]; if the time is discrete, this semi-group is uniquely determined by $ P _ {1} $. | ||
====References==== | ====References==== | ||
<table><TR><TD valign="top">[a1]</TD> <TD valign="top"> K.L. Chung, "Elementary probability theory with stochastic processes" , Springer (1974)</TD></TR></table> | <table><TR><TD valign="top">[a1]</TD> <TD valign="top"> K.L. Chung, "Elementary probability theory with stochastic processes" , Springer (1974)</TD></TR></table> |
Latest revision as of 09:50, 29 October 2023
The matrix $ P _ {t} = \| p _ {ij} ( t) \| $
of transition probabilities in time $ t $
for a homogeneous Markov chain $ \xi ( t) $
with at most a countable set of states $ S $:
$$ p _ {ij} ( t) = {\mathsf P} \{ \xi ( t) = j \mid \xi ( 0) = i \} ,\ \ i, j \in S. $$
The matrices $ \| p _ {ij} ( 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, j \in S $:
$$ p _ {ij} ( t) \geq 0,\ \ \sum _ {j \in S } p _ {ij} ( t) = 1, $$
i.e. they are stochastic matrices (cf. Stochastic matrix), while for irregular chains
$$ p _ {ij} ( t) \geq 0,\ \ \sum _ {j \in S } p _ {ij} ( t) \leq 1, $$
such matrices are called sub-stochastic.
By virtue of the basic (Chapman–Kolmogorov) property of a homogeneous Markov chain,
$$ p _ {ij} ( s+ t) = \sum _ {k \in S } p _ {ik} ( s) p _ {kj} ( t), $$
the family of matrices $ \{ {P _ {t} } : {t > 0 } \} $ forms a multiplicative semi-group; if the time is discrete, this semi-group is uniquely determined by $ P _ {1} $.
References
[a1] | K.L. Chung, "Elementary probability theory with stochastic processes" , Springer (1974) |
Matrix of transition probabilities. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Matrix_of_transition_probabilities&oldid=13510