Abstract
This chapter discusses the rate of escape problem for a class of random walks. The rate of escape problem was first considered for simple random walk in dimension d ≥ 3 by Dvoretzky and Erdös. The only known result that applies to all symmetric distributions for the summands is by Kesten who proved Erickson's conjecture that in dimension d ≥ 3, any random walk escapes at least as fast as simple random walk.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call