2000 character limit reached
On the slowdown of random walk in random environment with bounded jumps
Published 5 Mar 2013 in math.PR | (1303.1097v1)
Abstract: In this paper we prove that under certain assumptions the transient random walk in random environment with bounded jumps (in $\mathbb{Z}$) grows much slower than the speed $n$. Precisely, there is $0<s<1$, such that although $X_n\rto$ we have $\frac{X_n}{n{s'}}\rightarrow 0$ for $0<s<s'$ almost surely.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.