2
$\begingroup$

Let's consider an asymmetric Random Walk on $Z$, with transition probabilities $p_{i, i+1}=p$, $~~p_{i, i+1}=q$, $\forall i \in \mathcal{Z}$, $p+q=1$ and $p>q$.

I am interested in the probability of the first hitting time of a bareer in $i=n$, assuming that the walk started from $i=0$ at time $t=0$. Is there an explicit formula for it? How does it depend on $n$?

$\endgroup$
3
  • $\begingroup$ This is an exercise. The reflection principle lets you count the walks which first arrive at $n$ at time $t$. These all have the same probability, since they all have $n$ more positive steps than negative steps. $\endgroup$ Commented Mar 11, 2013 at 17:28
  • $\begingroup$ This has been answered fully in math.stackexchange.com/questions/64919/… $\endgroup$ Commented Mar 11, 2013 at 17:56
  • $\begingroup$ The answer by Did suggests another solution by generating functions but the reflection method is much simpler. $\endgroup$ Commented Mar 11, 2013 at 20:14

1 Answer 1

5
$\begingroup$

The explicit formula is: $P[N_m=n]=(m/n)P[S_n=m]$, where $P[N_m=n]$ is the probability the position $m$ is hit after exactly $n$ steps, $S_n = X_1+X_2+\dots X_n$ and $P[S_n=m]$ is the probablity after $n$ steps the path to be at the position $m$. This last is well-known and is given by

$$P[S_n=m]=\frac{n!}{[(n+m)/2]![(n-m)/2]!}p^{(n+m)/2}q^{(n-m)/2}.$$

This is true when $n$ and $m$ have the same parity, else the probability is zero. Additionally $m$ is positive and $n$ is greater than or equal to $m$. A similar expression can be found for negative $m$.

$\endgroup$
2
  • $\begingroup$ A proof using reflection principle here , p.6 $\endgroup$
    – C.C.
    Commented Jun 22, 2022 at 3:00
  • $\begingroup$ @C.C. (your link is broken, a copy is available on the wayback machine here) $\endgroup$ Commented Jan 12 at 12:22

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .