# Question: A particle moves on a circle through points that have

A particle moves on a circle through points that have been marked 0, 1, 2, 3, 4 (in a clockwise order). The particle starts at point 0. At each step it has probability 0.5 of moving one point clockwise (0 follows 4) and 0.5 of moving one point counterclockwise. Let Xn (n > 0) denote its location on the circle after step n. {Xn} is a Markov chain.

(a) Construct the (one-step) transition matrix.

(b) Use your IOR Tutorial to determine the n-step transition matrix P(n) for n = 5, 10, 20, 40, 80.

(c) Use your IOR Tutorial to determine the steady-state probabilities of the state of the Markov chain. Describe how the probabilities in the n-step transition matrices obtained in part (b) compare to these steady-state probabilities as n grows large.

(a) Construct the (one-step) transition matrix.

(b) Use your IOR Tutorial to determine the n-step transition matrix P(n) for n = 5, 10, 20, 40, 80.

(c) Use your IOR Tutorial to determine the steady-state probabilities of the state of the Markov chain. Describe how the probabilities in the n-step transition matrices obtained in part (b) compare to these steady-state probabilities as n grows large.

## Relevant Questions

Read Selected Reference A11 that describes an OR study done for Philips Electronics. (a) Summarize the background that led to undertaking this study. (b) What was the purpose of this study? (c) What were the benefits of ...Refer to Selected Reference A4 that describes an OR study done for Yellow Freight System, Inc. (a) Referring to pp. 147–149 of this article, summarize the background that led to undertaking this study. (b) Referring to p. ...Read the referenced article that fully describes the OR study summarized in the application vignette presented in Sec. 2.2. List the various financial and nonfinancial benefits that resulted from this study. Consider the following problem, where the values of c1 and c2 have not yet been ascertained. Maximize Z = c1x1 + c2x2, Subject to and x1 ≥ 0, x2 ≥ 0. Given the following (one-step) transition matrices of a Markov chain, determine the classes of the Markov chain and whether they are recurrent. (a) (b)Post your question