The number of rolls the publisher has are 0, 1, 2, 3 at the start of the day. Let use define states as 0, 1, 2, 3 denoting the number of rolls of newsprint in the warehouse at the start of the day.
P(Xn+1 = j | Xn = i) is the probability that number of rolls of newsprint in the warehouse at the start of the day is j, given number of rolls of newsprint in the warehouse at the start of the previous day is i. One roll is used by the warehouse. Then
j = i - 1 + x where x is the number of rolls delivered and follows binomial distribution.
Since, number of deliveries are independent over days, j depends only on i (previous state).
Thus, the next transition depends only on the previous state and hence {Xn} is a Markov chain.
The transition from state 0 to state 0 is possible for x = 0, 1. So, the transition from state 0 to state 0 is (1/8) + (3/8) = 1/2
The transition from state 0 to state 1 is possible for x = 2 with probability 3/8
The transition from state 0 to state 2 is possible for x = 3 with probability 1/8
The transition from state 1 to state 0 is possible for x = 0 with probability 1/8
The transition from state 1 to state 1 is possible for x = 1 with probability 3/8
The transition from state 1 to state 2 is possible for x = 2 with probability 3/8
The transition from state 1 to state 3 is possible for x = 3 with probability 1/8
The transition from state 2 to state 1 is possible for x = 0 with probability 1/8
The transition from state 2 to state 2 is possible for x = 1 with probability 3/8
The transition from state 2 to state 3 is possible for x = 2, 3 with probability (3/8 + 1/8) = 1/2
The transition from state 3 to state 2 is possible for x = 0 with probability 1/8
The transition from state 3 to state 3 is possible for x = 1, 2, 3 with probability (3/8 + 3/8 + 1/8) = 7/8
The transition matrix is,
A2. A newspaper publisher uses one roll of newsprint every day. A local supplier delivers a...