Markov Chains
View .md

Absorption Problems

Absorbing States

An absorbing state is a state that, once entered, cannot be left:

pii=1(if state i is absorbing)p_{ii} = 1 \quad \text{(if state } i \text{ is absorbing)}

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 ii, what’s the probability of eventually being absorbed in state jj?

Let aia_i = probability of absorption in a target state, starting from state ii.

Recursion

ai=∑kpik⋅aka_i = \sum_k p_{ik} \cdot a_k

We either:

  1. Transition to an absorbing state (absorbed!)
  2. Transition to a transient state (recurse)

Expected Time to Absorption

Key question: Starting from state ii, what’s the expected number of steps until absorption?

Let tit_i = expected time to absorption, starting from state ii.

Recursion

ti=1+∑k transientpik⋅tkt_i = 1 + \sum_{k \text{ transient}} p_{ik} \cdot t_k

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 (0)orwealthy(0) or wealthy (N).

States

  • 0: Broke (absorbing)
  • 1, 2, …, N-1: Playing (transient)
  • N: Wealthy (absorbing)

Absorption Probabilities

Let aia_i = probability of reaching NN before 00, starting with ii.

For fair game (p = 0.5):

ai=iNa_i = \frac{i}{N}

For biased game (p ≠ 0.5):

ai=1−(q/p)i1−(q/p)Na_i = \frac{1 - (q/p)^i}{1 - (q/p)^N}

where q=1−pq = 1 - p.

Expected Duration

For fair game:

ti=i(N−i)t_i = i(N - i)


Solving Absorption Problems

Method

  1. Identify absorbing and transient states
  2. Set up equations for absorption probability or expected time
  3. Use boundary conditions (absorbing states have known values)
  4. Solve the system of equations

Boundary Conditions

  • For absorption probability: aj=1a_j = 1 if jj is the target absorbing state, aj=0a_j = 0 for other absorbing states
  • For expected time: tj=0t_j = 0 if jj 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 ii
  • Extinction is absorbing
  • Question: Probability of extinction?

Key Terms

Absorbing StateA state i where P(i→i) = 1 — once entered, the chain never leaves.
Absorption ProbabilityThe probability that the chain eventually enters a particular absorbing state.
Expected Time to AbsorptionThe average number of steps until the chain reaches an absorbing state.
Gambler's RuinThe probability that a gambler goes broke before reaching a target, modeled as a Markov chain with absorbing states at 0 and N.