Two-State Chain Return Time
Each day is classified good (G) or bad (B). If today is G, tomorrow is G with probability (and B otherwise); if today is B, tomorrow is B with probability (and G otherwise). You wake up on a bad day. Find the expected number of days until the next bad day.
Work it out, then compare with the answer.
Answer
SolutionShow the worked solution
Let be the number of days until the next bad day, counting from today (a bad day). Condition on tomorrow.
- With probability tomorrow is bad, and then .
- With probability tomorrow is good. From a good day, each subsequent day is bad with probability , independently of the past. So the further wait is , with mean . In this case .
Hence
Alternative. The mean return time to a state of an irreducible finite chain is of that state. Balancing the flow between the two states gives
So , and therefore . The mean return time to is then .
Generalisation. Write and . Then , and the mean return time to is .