Random walks with echoed steps I
Abstract
A random walk with echoed steps (RWES) is a process \Sn\n≥1=\X1+·s+Xn\n≥1 that inserts memory and echo into an ordinary random walk (ORW) with i.i.d. steps, X1+·s+Xn. The RWES is defined recursively as follows. Let S1=X1. With probability 1-p, the n-th increment of the RWES follows that of the ORW, Xn=Xn. Otherwise, Xn is set as a random echo of a uniform sample of the past steps X1,…,Xn-1 determined by a random factor n. Namely, Xn=nXU[n] with probability p, where U[n]\1,…,n-1\. The RWES is a broad generalization of the elephant random walk and of the positively/negatively/unbalanced step-reinforced random walks. We determine strong convergences of S when the echo law is non-negative. The rates of convergence are determined by the product pE and exhibit a phase transition with critical value at pE=1. Highlight that in its super-critical regime, the RWES has super-linear scaling exponents --observed for the first time in this type of random walks with memory--. We provide Laws of Large Numbers, conditions for the convergence of S around its mean towards random series and provide some distributional properties of the limits. Our approach relies on the interpretation of the model in terms of continuous time branching random walks, random recursive trees, P\'olya urns, and associated martingales.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.