Question

A Markov chain is said to be a tree process if 75. (i) Pii 0 whenever Pi > 0, (ii) for every pair of states i and , i夭, there is a unique sequence of distinct states l = 10, 11, . . . , In-1, In-1 such that k=0,1 0, > 4,4+1 In other words, a Markov chain is a tree process if for every pair of distinct states i and j there is a unique way for the process to go from i to j without reentering a state (and this path is the reverse of the unique path from j to i). Argue that an ergodic tree process is time reversible.

Answer 1

e,Aのmaer, cern o.daea frocess, th every pain ersantine. i, on eve Thene en tk do,

Sin се em ce en