<< Chapter < Page Chapter >> Page >

The transition matrix for [link] is given below.

This matrix depicts the probability that Professor Symons will walk or bicycle to work on Monday or Tuesday.

Write the transition matrix from a) Monday to Thursday, b) Monday to Friday.

In writing a transition matrix from Monday to Thursday, we are moving from one state to another in three steps. That is, we need to compute T 3 size 12{T rSup { size 8{3} } } {} .

T 3 = 11 / 32 21 / 32 21 / 64 43 / 64 size 12{T rSup { size 8{3} } = left [ matrix { "11"/"32" {} # "21"/"32" {} ##"21"/"64" {} # "43"/"64"{} } right ]} {}

b) To find the transition matrix from Monday to Friday, we are moving from one state to another in 4 steps. Therefore, we compute T 4 size 12{T rSup { size 8{4} } } {} .

T 4 = 43 / 128 85 / 128 85 / 256 171 / 256 size 12{T rSup { size 8{4} } = left [ matrix { "43"/"128" {} # "85"/"128" {} ##"85"/"256" {} # "171"/"256"{} } right ]} {}

It is important that the student is able to interpret the above matrix correctly. For example, the entry 85 / 128 size 12{"85"/"128"} {} , states that if Professor Symons walked to school on Monday, then there is 85 / 128 size 12{"85"/"128"} {} probability that he will bicycle to school on Friday.

Got questions? Get instant answers now!
Got questions? Get instant answers now!

There are certain Markov chains that tend to stabilize in the long run, and they are the subject of [link] . It so happens that the transition matrix we have used in all the above examples is just such a Markov chain. The next example deals with the long term trend or steady-state situation for that matrix.

Suppose Professor Symons continues to walk and bicycle according to the transition matrix given in [link] . In the long run, how often will he walk to school, and how often will he bicycle?

As mentioned earlier, as we take higher and higher powers of our matrix T size 12{T} {} , it should stabilize.

T 5 = . 333984 . 666015 . 333007 . 666992 size 12{T rSup { size 8{5} } = left [ matrix { "." "333984" {} # "." "666015" {} ##"." "333007" {} # "." "666992"{} } right ]} {}
T 10 = . 33333397 . 66666603 . 33333301 . 66666698 size 12{T rSup { size 8{"10"} } = left [ matrix { "." "33333397" {} # "." "66666603" {} ##"." "33333301" {} # "." "66666698"{} } right ]} {}
T 20 = 1 / 3 2 / 3 1 / 3 2 / 3 size 12{T rSup { size 8{"20"} } = left [ matrix { 1/3 {} # 2/3 {} ##1/3 {} # 2/3{} } right ]} {}

Therefore, in the long run, Professor Symons will walk to school 1 / 3 size 12{1/3} {} of the time and bicycle 2 / 3 size 12{2/3} {} of the time.

Got questions? Get instant answers now!
Got questions? Get instant answers now!

When this happens, we say that the system is in steady-state or state of equilibrium. In this situation, all row vectors are equal. If the original matrix is an n size 12{n} {} by n size 12{n} {} matrix, we get n vectors that are all the same. We call this vector a fixed probability vector or the equilibrium vector E size 12{E} {} . In the above problem, the fixed probability vector E size 12{E} {} is 1 / 3 2 / 3 size 12{ left [ matrix { 1/3 {} # 2/3{}} right ]} {} . Furthermore, if the equilibrium vector E size 12{E} {} is multiplied by the original matrix T size 12{T} {} , the result is the equilibrium vector E size 12{E} {} . That is,

ET = E size 12{ ital "ET"=E} {}

or,

1 / 3 2 / 3 1 / 2 1 / 2 1 / 4 3 / 4 = 1 / 3 2 / 3 size 12{ left [ matrix { 1/3 {} # 2/3{}} right ] left [ matrix {1/2 {} # 1/2 {} ## 1/4 {} # 3/4{}} right ]= left [ matrix {1/3 {} # 2/3{} } right ]} {}

Regular markov chains

At the end of [link] , we took the transition matrix T size 12{T} {} and started taking higher and higher powers of it. The matrix started to stabilize, and finally it reached its steady-state or state of equilibrium . When that happened, all the row vectors became the same, and we called one such row vector a fixed probability vector or an equilibrium vector E size 12{E} {} . Furthermore, we discovered that ET = E size 12{ ital "ET"=E} {} .

Section overview

In this section, we wish to answer the following four questions.

  1. Does every Markov chain reach a state of equilibrium?
  2. Does the product of an equilibrium vector and its transition matrix always equal the equilibrium vector? That is, does ET = E size 12{ ital "ET"=E} {} ?
  3. Can the equilibrium vector E size 12{E} {} be found without raising the matrix to higher powers?
  4. Does the long term market share distribution for a Markov chain depend on the initial market share?

Does every Markov chain reach the state of equilibrium?

Answer: A Markov chain reaches a state of equilibrium if it is a regular Markov chain. A Markov chain is said to be a regular Markov chain if some power of it has only positive entries.

Got questions? Get instant answers now!
Got questions? Get instant answers now!

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, Applied finite mathematics. OpenStax CNX. Jul 16, 2011 Download for free at http://cnx.org/content/col10613/1.5
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Applied finite mathematics' conversation and receive update notifications?

Ask