Regular Markov Chains: Identifying and Analyzing Regular Transition Matrices - Prof. D. La, Study notes of Mathematics

Lecture notes on regular markov chains, explaining the concept of regular transition matrices, their applications in making long-range predictions, and methods to determine if a matrix is regular or not. It includes examples and calculations to illustrate the concepts.

Typology: Study notes

Pre 2010

Uploaded on 02/10/2009

koofers-user-s3m
koofers-user-s3m 🇺🇸

9 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 166 Lecture Notes M.2
Section M.2 Regular Markov Chains
One of the many applications of Markov chains is in making long-range predictions.
It is not possible to make long-range predictions with all transition matrices. However,
for a particular group of transition matrices it is always possible. If a transition matrix is
“regular”, it will always be possible. A transition matrix is regular if some power of the
matrix contains all positive entries (no zeroes!).
A question that will soon come up is this…. How far must you go (with powers of the
matrix) to be certain that a matrix is not regular? The answer is that if zeros occur in the
same positions in two successive powers of a matrix, then they will appear in those
positions for all higher powers of the matrix.
Example 1: Is the transition matrix given below “regular”?
T =
.30.55.10
.10.20.65
.60.25.25
Find: T
50
=
_______________
_______________
_______________
Example 2: Is the transition matrix given below “regular”?
T =
0.8.35
.60.45
.4.2.2
Find: T
2
=
_________
_________
_________
, T
30
=
_______________
_______________
_______________
Example 3: Is the transition matrix given below “regular”?
T =
000.5
0.40.80.5
0.60.20
Find: T
2
=
_________
_________
_________
, T
3
=
____________
____________
____________
,
T
50
=
____________
____________
____________
Example 4: Is the transition matrix given below “regular”?
T =
000.5
0.610
0.400.5
Find: T
2
=
_________
_________
_________
, T
3
=
____________
____________
____________
,
Compute and comment on T
50
.
pf3

Partial preview of the text

Download Regular Markov Chains: Identifying and Analyzing Regular Transition Matrices - Prof. D. La and more Study notes Mathematics in PDF only on Docsity!

Math 166 Lecture Notes M. Section M.2 Regular Markov Chains One of the many applications of Markov chains is in making long-range predictions.It is not possible to make long-range predictions with all transition matrices. However, for a particular group of transition matrices it “regular”, it will always be possible. A transition matrix is regular if some power of the is always possible. If a transition matrix is matrix contains all positive entries (no zeroes!). A question that will soon come up is this…. How far must you go (with powers of thematrix) to be certain that a matrix is not regular? The answer is that if zeros occur in the same positions in two successive powers of a matrix, then they will appear in thosepositions for all higher powers of the matrix.

Example 1: Is the transition matrix given below “regular”?

T = 

 

 

 

 .10 .55.

.65 .20.

.25 .25. Find: T 50 = 

 

 

 




Example 2: Is the transition matrix given below “regular”?

T = 

 

 

 

 .35 .8 0

.45 0.

.2 .2. Find: T 2 = 

___ ___ ___

___ ___ ___

___ ___ ___

, T 30 = 

_____ _____ _____

_____ _____ _____

_____ _____ _____

Example 3: Is the transition matrix given below “regular”?

T = 

 

 

 

 0.5 0 0

0.5 0.8 0.

0 0.2 0. Find: T 2 = 

___ ___ ___

___ ___ ___

___ ___ ___

, T 3 = 

____ ____ ____

____ ____ ____

____ ____ ____

,

T 50 = 

____ ____ ____

____ ____ ____

____ ____ ____

Example 4: Is the transition matrix given below “regular”?

T = 

 

 

 

 0.5 0 0

0 1 0.

0.5 0 0. Find: T 2 = 

___ ___ ___

___ ___ ___

___ ___ ___

, T 3 = 

____ ____ ____

____ ____ ____

____ ____ ____

,

Compute and comment on T 50.

Equilibrium vector of a Markov Chain. If a Markov chain with transition matrix T is regular, then there is a unique vector V such that, for any probability vector v and for large values of n, T nv =V. If a Markov chain with transition matrix T is regular,then there exists a probability vector V such that TV = V. Vector V is the equilibrium vector of the Markov Chain. Note: The sum of the entries in the probability vector must be 1!

Example 5 Find the equilibrium or steady-state vector for the transition matrix::

T = 

 

 

 

 0.2 0.8 0.

0.6 0.1 0.

0.2 0.1 0. .

Solution Find the probability vector V such that TV = V. (if it exists):

Let V =  

 

 

 z

y

x

. Then 

 

 

 

 0.2 0.8 0.

0.6 0.1 0.

0.2 0.1 0. 

 

 

 

 z

y

x =  

 

 

 z

y

x .

Performing the matrix multiplication, we get:



 

 

 

x y z

x y z

x y z 2 8 4

=  

 

 

 z

y

x , or the equations: x y z z

x y z y

x y z x

    • =

or

. 2. 8. 6 0

x y z

x y z

x y z

Add to those the additional equation x + y+z= 1 since x, y, and z are probabilities for an entire sample space. Solve the resulting system:

x y z

x y z

x y z

x y z

Recall that you can solve the systems of equations using the augmented matrix and rreffunction in the calculator.



 

 

 

 z

y

x =  

 

 

 4783