arXiv Analytics

Sign in

arXiv:0902.1026 [math.PR]AbstractReferencesReviewsResources

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

Ross Pinsky

Published 2009-02-06, updated 2009-06-07Version 3

Consider a simple random walk on the integers with the following transition mechanism. At each site $x$, the probability of jumping to the right is $\omega(x)\in[\frac12,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 $\frac12$. We investigate the transience/recurrence properties of this process in both deterministic and stationary, ergodic environments $\{\omega(x)\}_{x\in Z}$. In deterministic environments, we also study the speed of the process.

Comments: This version adds a monotonicity result which was missing from the previous version
Categories: math.PR
Subjects: 60G50, 60K37, 60G42
Related articles: Most relevant | Search more
arXiv:1506.03048 [math.PR] (Published 2015-06-09)
Strong transience of one-dimensional random walk in a random environment
arXiv:math/0503576 [math.PR] (Published 2005-03-25, updated 2006-02-20)
Quenched invariance principle for simple random walk on percolation clusters
arXiv:1011.1196 [math.PR] (Published 2010-11-04, updated 2012-10-04)
Conditional and uniform quenched CLTs for one-dimensional random walks among random conductances