Professional Documents
Culture Documents
STAT 408 Part 2
STAT 408 Part 2
be the conditional probability that the process will have transition to state 𝑗𝑗 at time
𝑛𝑛 given that it was in state 𝑖𝑖 at time 𝑚𝑚.
Example: (Gambling) If the coin is fair
(2,4) 1
𝑝𝑝31 = 𝑃𝑃(𝑋𝑋4 = 1 | 𝑋𝑋2 = 3) =
4
When 𝑛𝑛 = 𝑚𝑚 + 1, we have
(𝑚𝑚,𝑚𝑚+1)
𝑝𝑝𝑖𝑖𝑖𝑖 = 𝑃𝑃(𝑋𝑋𝑚𝑚+1 = 𝑗𝑗 | 𝑋𝑋𝑚𝑚 = 𝑖𝑖); 𝑖𝑖 ∈ 𝑆𝑆, 𝑗𝑗 ∈ 𝑆𝑆
3
Also, the 𝑛𝑛-step transition probability for a time-homogeneous Markov Chain can
(𝑚𝑚,𝑚𝑚+𝑛𝑛) (𝑛𝑛)
be written as 𝑝𝑝𝑖𝑖𝑖𝑖 = 𝑝𝑝𝑖𝑖𝑖𝑖 . For 𝑛𝑛 ≥ 2, we cannot drop 𝑛𝑛.
Example: (Gambling)
(2,3) 1
𝑝𝑝34 = 𝑃𝑃(𝑋𝑋3 = 4 | 𝑋𝑋2 = 3) =
2
(4,5) 1
𝑝𝑝34 = 𝑃𝑃(𝑋𝑋5 = 4 | 𝑋𝑋4 = 3) =
2
Therefore, the chain is time-homogeneous. We can write both the probabilities as
(1)
𝑝𝑝34 = 𝑝𝑝34 .