1
$\begingroup$

Find boundary conditions that allow the recursion $f(k)=\frac{1}{2} f(k-1) + \frac{1}{2} f(k+1)$ for $-B to uniquely determine the function $f(k)=P(S_{\tau}=A|S_o=k)$ where $\tau = \min {\{ n\geq 0: S_n = A \space \text{or}\space S_n = -B}\}$ where $S_n$ is the position of the simple random walker after $n$ steps.

The boundary conditions $f(A) = 1$ and $f(-B)=0$ uniquely determine $f$, but I am not certain as to why these values give the unique solution. I've encountered this in several books and I always took it for granted, but never quite figured out the intuition behind the solution.

  • 0
    Got something from an answer below?2012-08-11

2 Answers 2

1

The condition $f(k)=\frac{1}{2} f(k-1) + \frac{1}{2} f(k+1)$ can be rewritten as $f(k)-f(k-1) =f(k+1)-f(k).$ This means that $f$ is a straight line function, and so is completely determined by its values at the two boundary points.

1

As @Byron explained, for every pair of conditions $(a,b)$, there exists a unique function $f$ solving the recursion and such that $f(A)=a$, $f(-B)=b$. If the question is why one should use $(a,b)=(1,0)$ in the case at hand, the answer is that $\tau=0$ when $S_0=A$ and when $S_0=-B$, hence the probability of the event $[S_\tau=A]=[S_0=A]$ is $1$ when $S_0=A$ and $0$ when $S_0=-B$.