Absorption Problems
Absorbing States
An absorbing state is a state that, once entered, cannot be left:
Examples
- Gambler’s ruin: “Broke” and “wealthy” are absorbing states
- Game completion: “Win” and “lose” are absorbing states
- System failure: “Failed” is an absorbing state
Absorption Probability
Key question: Starting from state , what’s the probability of eventually being absorbed in state ?
Let = probability of absorption in a target state, starting from state .
Recursion
We either:
- Transition to an absorbing state (absorbed!)
- Transition to a transient state (recurse)
Expected Time to Absorption
Key question: Starting from state , what’s the expected number of steps until absorption?
Let = expected time to absorption, starting from state .
Recursion
We take one step, then add expected time from the new state (if not yet absorbed).
Example: Gambler’s Ruin
A gambler starts with $i and makes $1 bets. Game ends when broke (N).
States
- 0: Broke (absorbing)
- 1, 2, …, N-1: Playing (transient)
- N: Wealthy (absorbing)
Absorption Probabilities
Let = probability of reaching before , starting with .
For fair game (p = 0.5):
For biased game (p ≠ 0.5):
where .
Expected Duration
For fair game:
Solving Absorption Problems
Method
- Identify absorbing and transient states
- Set up equations for absorption probability or expected time
- Use boundary conditions (absorbing states have known values)
- Solve the system of equations
Boundary Conditions
- For absorption probability: if is the target absorbing state, for other absorbing states
- For expected time: if is any absorbing state
Applications
Reliability
- System starts working
- Components fail with certain probabilities
- Absorbing state = system failure
- Question: Expected time to failure?
Games
- Player starts at some level
- Win/lose conditions are absorbing
- Question: Probability of winning?
Population Models
- Population starts at size
- Extinction is absorbing
- Question: Probability of extinction?