Transience/Recurrence and the speed of a one-dimensional random walk in a "have your cookie and eat it" environment
Ross Pinsky

TL;DR
This paper studies a one-dimensional random walk with a 'cookie' environment where the probability to jump right is initially biased but becomes fair after the first left jump at each site, analyzing its transience, recurrence, and speed.
Contribution
It introduces a model with a dynamic transition mechanism and characterizes its transience, recurrence, and speed in deterministic and ergodic environments.
Findings
Characterizes conditions for transience and recurrence.
Analyzes the speed of the walk in deterministic environments.
Provides insights into the impact of environment on walk behavior.
Abstract
Consider a simple random walk on the integers with the following transition mechanism. At each site , the probability of jumping to the right is , until the first time the process jumps to the left from site , from which time onward the probability of jumping to the right is . We investigate the transience/recurrence properties of this process in both deterministic and stationary, ergodic environments . In deterministic environments, we also study the speed of the process.
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.
