Transience/recurrence and the speed of a one-dimensional random walk in a ``have your cookie and eat it'' environment (Q629780): Difference between revisions

A variant of the simple random walk on integers with the following transition mechanism is considered. At each site \(x \in \mathbb{Z}\), the probability of jumping to the right is \(\omega(x) \in [\frac{1}{2},1)\), until the first time the process jumps to the left from site \(x\), from which time onward the probability of jumping to the right is \(\frac{1}{2}\). The transience/recurrence properties are investigated in both deterministic and stationary ergodic environments. In deterministic environment, the speed of the process is also studied. Some exact estimates are obtained. This setting develops the problem of random walk in cookie environment in which \(k\) cookies are initially placed at each site. The process eats them one by one when it visits the site and the probability of jumping to the right switches to \(\frac{1}{2}\) when all cookies at the site are eaten. The similarity of some results is discussed.