Persistent Random Walks. I. Recurrence Versus Transience

International audienceWe consider a walker on the line that at each step keeps the same direction with a probability which depends on the time already spent in the direction the walker is currently moving. These walks with memories of variable length can be seen as generalizations of directionally reinforced random walks introduced in Mauldin et al. (Adv Math 117(2):239–252, 1996). We give a complete and usable characterization of the recurrence or transience in terms of the probabilities to switch the direction and we formulate some laws of large numbers. The most fruitful situation emerges when the running times both have an infinite mean. In that case, these properties are related to the behaviour of some embedded random walk with an undefined drift so that these features depend on the asymptotics of the distribution tails related to the persistence times. In the other case, the criterion reduces to a null-drift condition. Finally, we deduce some criteria for a wider class of persistent random walks whose increments are encoded by a variable length Markov chain having—in full generality—no renewal pattern in such a way that their study does not reduce to a skeleton RW as for the original model