1.5k citations · 13.2k across the 148 of their papers we have counts for
1 paper · 2 filters
P. L. Krapivsky, S. Redner
We outline basic properties of a symmetric random walk in one dimension, in which the length of the nth step equals lambda^n, with lambda<1. As the number of steps N-->oo, the prob…