An Algorithm to Compute the Equilibrium Distribution of a One-Dimensional Bounded Random Walk

We present an algorithm that is suitable for finding the equilibrium distribution of a one-dimensional random walk in the presence of one or more boundaries. The method involves the evaluation of a “reduced” difference equation whose coefficients are found to have the very useful property of being insensitive to small changes in the parameters of the random walk and to rounding errors in the computation.