A random walk with reflecting barriers 0 and (N) is a Markov chain whose state space is
Question:
A random walk with reflecting barriers 0 and \(N\) is a Markov chain whose state space is \(E=\{0,1,2, \ldots, N\}\), which, at any state strictly between 0 and \(N\), moves next to either the state immediately to the left or immediately to the right with equal probability. If the chain is at state 0 , then it is certain to be at state 1 at the next time; and if it is at state \(N\), then it is certain to be at state \(N-1\) at the next time. For the random walk with reflecting barriers at 0 and 4 , find the conditional distribution of the state at time 6 , given that the initial state is each of: \(0,1,2,3\), and 4 .
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Introduction To The Mathematics Of Operations Research With Mathematica
ISBN: 9781574446128
1st Edition
Authors: Kevin J Hastings
Question Posted: