Suppose that {X,:n 2 0} is a finite Markov chain with the state space S= {1,.., M}, when M is a positive integer (M < 0). Prove that there can be no null recurrent states in the chain. (Hint: Consider the cases (i) S is irreducible and (ii) S is reducible.)

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 13EQ
icon
Related questions
Question
1
Suppose that {Xn:n 2 0} is a finite Markov chain with the state space S= {1,..., M}, when M is
a positive integer (M < 00). Prove that there can be no null recurrent states in the chain. (Hint:
Consider the cases (i) S is irreducible and (ii) S is reducible.)
Transcribed Image Text:Suppose that {Xn:n 2 0} is a finite Markov chain with the state space S= {1,..., M}, when M is a positive integer (M < 00). Prove that there can be no null recurrent states in the chain. (Hint: Consider the cases (i) S is irreducible and (ii) S is reducible.)
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Linear Algebra: A Modern Introduction
Linear Algebra: A Modern Introduction
Algebra
ISBN:
9781285463247
Author:
David Poole
Publisher:
Cengage Learning
Elementary Linear Algebra (MindTap Course List)
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:
9781305658004
Author:
Ron Larson
Publisher:
Cengage Learning