Admistrivia
- Readings: Chapter 3 up to page 126
- Questions from the homework?
Chapter III.4: First step analysis
Consider the matrix: (with indices of 0,1,2)
- Suppose we start in state 0. What is probability of ever leaving?
- Suppose we start in state 2. What is probability of ever leaving?
- Called absorbing.
- Suppose we start in state 1. What is probability of entering
state 0 or state 2?
Where do we go?
- T = stopping time (absorbtion time)
- u = P(XT= 0|X0 = 1)
- (Martingale approach:)
- u = P(Xinfinity= 0|X0 = 1)
- E(I(Xinfinity)X0)) =
E(E(I(Xinfinity)|X1,X0)))) = ...
- Called first step analysis
- Induction: Suppose we knew it from time 1 on. Concrete first step analsyis.
When do we get there?
- T = stopping time (absorbtion time)
- v = E(T|X0 = 1)
- same methodology
Harder: 4 states
- What if there are two transiant states?
- There are now two probabilities of absorbing in state 0
- There are now two waiting times
- Same recursion:
1 | 0 | 0 | 0 |
.1 | .8 | .1 | 0 |
0 | .3 | .6 | .1 |
0 | 0 | 0 | 1 |
Which do we come to first?
the mouse example from the book
Dean P. Foster
Last modified: Thu Feb 7 12:50:24 EST 2008