Linear Algebra Matrix Limits/Stochastic Process

Click For Summary
The discussion focuses on a probability problem involving diaper liners that can be in three states: new, once used, and twice used. A transition matrix is established to model the probability of a liner moving between these states based on a soiling probability of one-third. The initial state vector represents all liners as new. The challenge lies in finding the limiting state probabilities as the number of uses approaches infinity, which can be solved by setting up a linear system of equations. The solution requires ensuring the rows of the transition matrix sum to one and applying the normalizing condition for the limiting vector.
lutheranian
Messages
1
Reaction score
0

Homework Statement



A diaper liner is placed in each diaper worn by a baby. If, after a diaper change, the liner is soiled, then it is discarded and replaced by a new liner. Otherwise, the liner is washed with the diapers and reused, except that each liner is discarded and replaced after its third use (even if it has never been soiled). The probability that the baby will soil any diaper liner is one third. If there are only new diaper liners at first, eventually what proportions of the diaper liners being used will be new, once used, and twice used? Hint: Assume that a diaper liner ready for use is in one of the three states: new, once used, or twice used. After its use, it then transforms into one of the three states described

Homework Equations




If A is a transition matrix and v is the initial state vector and

lim Am = L as m -->\infty then eventual state is Lv

The Attempt at a Solution



I set up the transition matrix with the first column/row corresponding to new liners, the second to once-used, and the third to twice-used, resulting in the following:

A= (1/3, 1/3, 1| 2/3, 0, 0 | 0, 2/3, 0)

The initial vector is v= (1, 0, 0)

I tried finding the limit of Am as m --> \infty using wolframalpha (which is allowed because the homework problems have messy numbers) but the computation times out every time.
 
Physics news on Phys.org
You can get the limiting state-probabilities by setting up and solving a linear system of 3 equations in 3 unknowns. Using the standard convention (with the ROWS summing to 1---not the columns, as you have chosen), the limiting (row) vector, u, satisfies u = u.A and sum u(j) = 1. Omit one of the three equations u(j) = sum_{k} u(k)*A(k,j), j=1,2,3, and replace it by the normalizing condition sum u = 1.

RGV
 
Last edited:
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 25 ·
Replies
25
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 6 ·
Replies
6
Views
4K
Replies
5
Views
2K
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K