Random walks with variable step length on regular lattices

Abstract

We study random walks on regular lattices, where the probability of steps of length r is proportional to r −6. For the diamond and the three cubic lattices we determine numerically the average number of distinct sites S( n) visited in an n-step walk. Applied to walks restricted to nearest-neighbor steps, our method agrees with the analytical expressions.