Random walk with random resetting to the maximum
Satya N. Majumdar, Sanjib Sabhapandit, Gregory Schehr

TL;DR
This paper analyzes a one-dimensional random walk with a novel resetting rule to the maximum visited site, revealing ballistic growth of maximum and position, explicit speed and diffusion coefficients, and a phase transition in the distribution of their difference.
Contribution
It introduces and analytically solves a new random walk model with maximum-based resetting, deriving growth laws, explicit coefficients, and phase transition phenomena.
Findings
Average maximum and position grow ballistically with rate v(r).
Fluctuations around averages grow diffusively with coefficient D(r).
Stationary distribution of the difference between maximum and position exists, with a phase transition.
Abstract
We study analytically a simple random walk model on a one-dimensional lattice, where at each time step the walker resets to the maximum of the already visited positions (to the rightmost visited site) with a probability , and with probability , it undergoes symmetric random walk, i.e., it hops to one of its neighboring sites, with equal probability . For , it reduces to a standard random walk whose typical distance grows as for large . In presence of a nonzero resetting rate , we find that both the average maximum and the average position grow ballistically for large , with a common speed . Moreover, the fluctuations around their respective averages grow diffusively, again with the same diffusion coefficient . We compute and explicitly. We also show that the probability distribution of the difference between…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
