pith. sign in

arxiv: math/0507411 · v1 · submitted 2005-07-20 · 🧮 math.PR · math-ph· math.MP

Recurrence for persistent random walks in two dimensions

classification 🧮 math.PR math-phmath.MP
keywords walksrandomrecurrencenewtonianpersistentbetterclassdepend
0
0 comments X
read the original abstract

We discuss the question of recurrence for persistent, or Newtonian, random walks in Z^2, i.e., random walks whose transition probabilities depend both on the walker's position and incoming direction. We use results by Toth and Schmidt-Conze to prove recurrence for a large class of such processes, including all "invertible" walks in elliptic random environments. Furthermore, rewriting our Newtonian walks as ordinary random walks in a suitable graph, we gain a better idea of the geometric features of the problem, and obtain further examples of recurrence.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.