Question: Let A be an n n positive stochastic matrix with dominant eigenvalue 1 = 1 and linearly independent eigenvectors x1, x2,..., xn, and let

Let A be an n × n positive stochastic matrix with dominant eigenvalue λ1 = 1 and linearly independent eigenvectors x1, x2,..., xn, and let y0 be an initial probability vector for a Markov chain
y0, y1 = Ay0, y2 = A1, ...
(a) Show that λ1 = 1 has a positive eigenvector x1.
(b) Show that ||yj||1 = 1, j = 0, 1,...
(c) Show that if
y0 = c1x1 + c2x2 + ... + cnxn
then the component c1 in the direction of the positive eigenvector x1 must be nonzero.
(d) Show that the state vectors yj of the Markov chain converge to a steady-state vector.
(e) Show that
c1 = 1 / ||x1||1
and hence the steady-state vector is independent of the initial probability vector y0.

Step by Step Solution

3.42 Rating (158 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a It follows from Exercise 12 that 1 1 is the dominant eigenvector of A By Perrons ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Document Format (1 attachment)

Word file Icon

949-M-L-A-E (880).docx

120 KBs Word File

Students Have Also Explored These Related Linear Algebra Questions!