Limit theorems for the trajectory of the self-repelling random walk with directed edges

Abstract

The self-repelling random walk with directed edges was introduced by T\'oth and Veto in 2008 as a nearest-neighbor random walk on Z that is non-Markovian: at each step, the probability to cross a directed edge depends on the number of previous crossings of this directed edge. T\'oth and Veto found this walk to have a very peculiar behavior, and conjectured that, denoting the walk by (Xm)m∈N, for any t ≥ 0 the quantity 1NX Nt converges in distribution to a non-trivial limit when N tends to +∞, but the process (1NX Nt )t ≥ 0 does not converge in distribution. In this paper, we prove not only that (1NX Nt )t ≥ 0 admits no limit in distribution in the standard Skorohod topology, but more importantly that the trajectories of the random walk still satisfy another limit theorem, of a new kind. Indeed, we show that for n suitably smaller than N and TN in a large family of stopping times, the process (1n(XTN+tn3/2-XTN))t ≥ 0 admits a non-trivial limit in distribution. The proof partly relies on combinations of reflected and absorbed Brownian motions which may be interesting in their own right.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…