1
$\begingroup$

Possible Duplicate:
Proving that 1- and 2-d simple symmetric random walks return to the origin with probability 1

This is a basic question but I was wondering if there was a simple proof (I have a rather complex one).

The problem is: Given a symmetric random walk ($P(X_i=1)=P(X_i=-1)=0.5$) and $S_n = \sum_{i=1}^n X_i$, define $T$ as $T=\inf\{n\geq0:S_n=a\}$, $S_0=0$. Prove that $T$ is almost surely finite, $P(T<\infty)=1$.

Thanks.

  • 0
    This is a multi-duplicate (and typical (homework)). You could try to compute $P(T_a\lt T_{-b})$, and let $b\to+\infty$.2012-07-23

1 Answers 1

0

The symmetric random walk is a recurrent and irreducible Markov Chain, thus by recurrence theorem $f_{ij}=1$ where $f_{ij}$ is the probability that starting from $i$ we have $X_n=j$ for some $n\geq 1$, that is $P(T<\infty)=1$.

  • 2
    In other words: $P(T\lt\infty)=1$ because $P(T\lt\infty)=1$.2012-07-23