How a random walk covers a finite lattice
暂无分享,去创建一个
A random walker is confined to a finite periodic d-dimensional lattice of N initially white sites. When visited by the walk a site is colored black. After t steps of the walk, for t scaled appropriately with N, we determined the structure of the set of white sites. The variance of their number has a line of critical points in the td plane, which separates a mean-field region from a region with enhanced fluctuations. At d = 2 the critical point becomes a critical interval. Moreover, for d = 2 the set of white sites is fractal with a fractal dimensionality whose t-dependence we determine.
[1] H. Hilhorst,et al. Covering of a finite lattice by a random walk , 1991 .
[2] Some exact results for the lattice covering time problem , 1990 .
[3] Nemirovsky,et al. Universality in the lattice-covering time problem. , 1990, Physical review. A, Atomic, molecular, and optical physics.
[4] The lattice covering time problem for sites visitedk-times , 1991 .
[5] D. Aldous. On the time taken by random walks on finite groups to visit every state , 1983 .