Julian C. answered 05/05/20
Math Master's Graduate and Software Engineer for Math/CS Tutoring
We will compute the 1-stage transition probability of the worm family increasing in size from 2 to 10 worms in one month.
The Markov chain under the discussion is one with a countably infinite state space, and this state space is the set of all possible values of the size of the worm family, namely, the set of non-negative integers, {0, 1, 2, 3, 4, ...}. This makes sense because the size of the worm family is initially equal to 2, but it's statistically possible for it to be equal to any non-negative integer the following month.
To compute the desired 1-stage transition probability P2,10 we need to consider all the 1-stage transition probabilities P2, i where i is any non-negative integer. If there are 2 worms in the family at any particular month, then the probability that any of the parents die by the following month is P2,0 + P2,1. The probability that both parents survive but they have no children by the following month is P2,2, so the probability that no child worms are born by the following month is P2,0 + P2,1 + P2,2 = 0.10.
Next, recall that it was assumed that the transition probability of n ≥ 1 child worms being added to the family at the end of the month is 0.5 the probability of only n-1 child worms being added. Thus, P2,3 = (0.5)P2,4 = (0.5)2P2,5 = (0.5)3P2,6 = ..., etc.
Therefore, 1 = ∑i=0∞P2,i = 0.1 + ∑i=3∞P2,i = 0.1 + P2,3∑i=0∞(0.5)i = 0.1 + 2P2,3, and so P2,3 = 0.45.
Finally, P2,10 = (0.5)7P2,3 = (0.5)7(0.45) ≈ 0.00351562.
Anyway, if my assumptions about the problem were wrong or you wish to discuss this problem further feel free to comment on this answer.