To begin, we consider a basic example of a discrete first passage process. Consider an unbiased Bernoulli walk on the integers starting at the origin. We wish to determine the probability, R, that the walker eventually returns to 0, regardless of the number of steps it takes. Without loss of generality, say the walker’s first step is to 1. From here, the walker can either step left to 0 or can ...
