Snakes and perturbed random walks

From MaRDI portal
Publication:2446212



Abstract: In this paper we study some properties of random walks perturbed at extrema, which are generalizations of the walks considered e.g., in Davis (1999). This process can also be viewed as a version of {em excited random walk}, studied recently by many authors. We obtain a few properties related to the range of the process with infinite memory. We also prove the Strong law, Central Limit Theorem, and the criterion for the recurrence of the perturbed walk with finite memory.


Let \(1\leq L\leq \infty\) be an integer and let \(\{X_k: k\geq1\}\) be a simple symmetric random walk, modified such that the transition probability \(=p\) if the current location equals \(\max_{m=0,1,\dots,L\wedge k}X_{k-m}\), \(=q\) if it equals \(\min_{m=0,1,\dots,L\wedge k}X_{k-m}\) (and \(1/2\) otherwise). \(L\) is interpreted as the length of the memory of the walk. The process thus obtained is called ``a random walk, perturbed at \(L\)-extrema. For the case \(L=\infty\), the authors obtain i.a.\ results on the time it takes until the length of the visited area reaches a certain value. For the finite case, the walk can be viewed as a Markov chain, and it is, e.g., shown that the chain is recurrent if \(p+q=1\). In addition, a strong law and a central limit theorem are also proved in this case. Some open problems are also mentioned.











This page was built for publication: Snakes and perturbed random walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446212)