Self-similarity and covered neighborhoods of fractals: A random walk test

Abstract A strong version of the property of self-similarity is described, and it is shown that this property is satisfied by random walks on a simple cubic lattice. When each site visited by the walk is surrounded by a small cube, the total volume of these covering cubes depends on the cube size, the size of the region investigated, and the length of the walk. We find that for long walks at a fixed ratio of cube to region size the filling ratio is roughly constant.