In Exercises 3 and 4, consider a Markov chain on {1, 2, 3} with the given transition matrix P. In each exercise, use two methods to find the probability that, in the long run, the chain is in state 1.
First, raise P to a high power. Then directly compute the steady-state
3. P =
Want to see the full answer?
Check out a sample textbook solutionChapter 10 Solutions
Linear Algebra and Its Applications (5th Edition)
- Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage LearningElementary Linear Algebra (MindTap Course List)AlgebraISBN:9781305658004Author:Ron LarsonPublisher:Cengage Learning