Random walks on sparsely periodic and random lattices

We have developed a new technique for calculating certain asymptotic random walk properties on sparsely periodic and related random lattices in two and three dimensions. This technique is based on an ansatz which relates the number of lattice bonds in “irreducible lattice fragments” to the number of steps along these bonds. We show that certain random walk properties can be calculated very simply on the basis of this ansatz and that they depend only on the density of bonds and not on the arrangement of the bonds within the lattice. The random walk properties calculated here (mean square displacements, number of distinct sites visited, probability of return to the origin) are in complete agreement with results obtained earlier via generating function techniques. A subsequent paper contains generating function calculations which verify a number of new results presented here, such as mean occupation frequency of lattice sites, and a proof of our basic assumption on the relation between the number of lattice bonds and random walk steps.