Put and . The Markov property and the state-independent transition probabilities show that, conditional on the whole previous history, is with probability and with probability . Multiplying these conditional probabilities for any finite step sequence proves that the are independent and identically distributed random variables, with
Because , the strong law of large numbers gives
In particular, almost surely. This stronger pathwise consequence will determine both eventual crossings and the asymptotic first-passage times.
For , the target is reached at time zero, so . For , the preceding almost sure convergence gives with probability one. A sample path with unit upward and downward steps must visit every intermediate integer when it crosses from a negative value to a positive value. It must therefore visit zero at a finite time. Thus
The unit-step property matters: positive long-run displacement alone would not force a walk with larger upward jumps to land exactly on zero.
The first-step analysis gives and, for ,
The minimal nonnegative solution for hitting probabilities theorem states that the probability of ever hitting a target is the pointwise smallest nonnegative solution of this transition recurrence with value one at the target. It follows by comparing any such solution with the probabilities of hitting within steps, then taking their increasing limit.
The characteristic equation has distinct roots and . Hence every solution on the nonnegative integers with boundary value one has the form
If it is nonnegative for all , taking forces , and therefore . The candidate is itself nonnegative and satisfies the recurrence and boundary value. It is consequently the minimal solution, giving the biased random walk hitting probability
On the negative half-line the already established values satisfy the same recurrence away from zero. No unproved boundary condition at infinity has been imposed.

Articles by others on the same topic (0)

There are currently no matching articles.