75. A Markov chain is said to be a tree process if (i) Pij > 0 whenever
Question:
75. A Markov chain is said to be a tree process if
(i) Pij > 0 whenever Pji > 0,
(ii) for every pair of states i and j , i = j , there is a unique sequence of distinct states i = i0,i1,...,in−1,in = j such that?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Question Posted: