paper

Number of distinct sites visited by a resetting random walker

arXiv:2202.04906 · doi:10.1088/1751-8121/ac6b69

Abstract

We investigate the number of distinct sites visited by an -step resetting random walker on a -dimensional hypercubic lattice with resetting probability . In the case , we recover the well-known result that the average number of distinct sites grows for large as for and as for . For , we show that grows extremely slowly as . We observe that the recurrence-transience transition at for standard random walks (without resetting) disappears in the presence of resetting. In the limit , we compute the exact crossover scaling function between the two regimes. In the one-dimensional case, we derive analytically the full distribution of in the limit of large . Moreover, for a one-dimensional random walker, we introduce a new observable, which we call imbalance, that measures how much the visited region is symmetric around the starting position. We analytically compute the full distribution of the imbalance both for and for . Our theoretical results are verified by extensive numerical simulations.

41 pages, 8 figs

References in corpus (21)

Cited by in corpus (12)