Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Question 2: A laboratory animal may eat any one of three foods each day. Laboratory records show that if the animal chooses one food on one trial, it will chose the same food on the next trial with a probability of 50%, and it will choose the other foods on the next trial with equal probabilities of 25%.

a. What is the stochastic matrix for this situation?

b. If the animal chooses food #1 on an initial trial, what is the probability that it will choose food #2 on the second trial after the initial trial?

Short Answer

Expert verified
  1. The stochastic matrix is \(P = \left( {\begin{array}{*{20}{c}}{.5}&{.25}&{.25}\\{.25}&{.5}&{.25}\\{.25}&{.25}&{.5}\end{array}} \right)\).
  2. The probability that the animal will choose food #2 after the initial trial is 0.3125.

Step by step solution

01

Determine the stochastic matrix

a)

Let the food be labeled 1, 2, and 3.

The following table represents the animal's behavior.

From:

To:

1

2

3

.5

.25

.25

.25

.5

.25

.25

.25

.5

1

2

3

From this, the stochastic matrix is \(P = \left( {\begin{array}{*{20}{c}}{.5}&{.25}&{.25}\\{.25}&{.5}&{.25}\\{.25}&{.25}&{.5}\end{array}} \right)\).

02

Determine the probability that will choose food #2 after the initial trial

b)

After the initial trial, there are two trials. The initial state vector is \({{\mathop{\rm x}\nolimits} _0} = \left( {\begin{array}{*{20}{c}}1\\0\\0\end{array}} \right)\).

Compute \({{\mathop{\rm x}\nolimits} _2}\) as shown below:

\(\begin{array}{c}{{\mathop{\rm x}\nolimits} _1} = P{{\mathop{\rm x}\nolimits} _0}\\ = \left( {\begin{array}{*{20}{c}}{.5}&{.25}&{.25}\\{.25}&{.5}&{.25}\\{.25}&{.25}&{.5}\end{array}} \right)\left( {\begin{array}{*{20}{c}}1\\0\\0\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}{0.5 + 0 + 0}\\{0.25 + 0 + 0}\\{0.25 + 0 + 0}\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}{0.5}\\{0.25}\\{0.25}\end{array}} \right)\end{array}\)

\(\begin{array}{c}{{\mathop{\rm x}\nolimits} _2} = P{{\mathop{\rm x}\nolimits} _1}\\ = \left( {\begin{array}{*{20}{c}}{.5}&{.25}&{.25}\\{.25}&{.5}&{.25}\\{.25}&{.25}&{.5}\end{array}} \right)\left( {\begin{array}{*{20}{c}}{.5}\\{.25}\\{.25}\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}{0.25 + 0.0625 + 0.0625}\\{0.25 + 0.125 + 0.0625}\\{0.125 + 0.0625 + 0.125}\end{array}} \right)\\ = \left( {\begin{array}{*{20}{c}}{0.375}\\{0.3125}\\{0.3125}\end{array}} \right)\end{array}\)

Thus, the probability that the animal will choose food #2 after the initial trial is 0.3125.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Let S be a maximal linearly independent subset of a vector space V. In other words, S has the property that if a vector not in S is adjoined to S, the new set will no longer be linearly independent. Prove that S must be a basis of V. [Hint: What if S were linearly independent but not a basis of V?]

In statistical theory, a common requirement is that a matrix be of full rank. That is, the rank should be as large as possible. Explain why an m n matrix with more rows than columns has full rank if and only if its columns are linearly independent.

Suppose the solutions of a homogeneous system of five linear equations in six unknowns are all multiples of one nonzero solution. Will the system necessarily have a solution for every possible choice of constants on the right sides of the equations? Explain.

Question 11: Let\(S\)be a finite minimal spanning set of a vector space\(V\). That is,\(S\)has the property that if a vector is removed from\(S\), then the new set will no longer span\(V\). Prove that\(S\)must be a basis for\(V\).

In Exercise 7, find the coordinate vector \({\left( x \right)_{\rm B}}\) of x relative to the given basis \({\rm B} = \left\{ {{b_{\bf{1}}},...,{b_n}} \right\}\).

7. \({b_{\bf{1}}} = \left( {\begin{array}{*{20}{c}}{\bf{1}}\\{ - {\bf{1}}}\\{ - {\bf{3}}}\end{array}} \right),{b_{\bf{2}}} = \left( {\begin{array}{*{20}{c}}{ - {\bf{3}}}\\{\bf{4}}\\{\bf{9}}\end{array}} \right),{b_{\bf{3}}} = \left( {\begin{array}{*{20}{c}}{\bf{2}}\\{ - {\bf{2}}}\\{\bf{4}}\end{array}} \right),x = \left( {\begin{array}{*{20}{c}}{\bf{8}}\\{ - {\bf{9}}}\\{\bf{6}}\end{array}} \right)\)

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free