2000 character limit reached
Computing the Drift of Random Walks in Dependent Random Environments
Published 12 Jun 2014 in math.PR | (1406.3390v1)
Abstract: Although the theoretical behavior of one-dimensional random walks in random environments is well understood, the numerical evaluation of various characteristics of such processes has received relatively little attention. This paper develops new theory and methodology for the computation of the drift of the random walk for various dependent random environments, including $k$-dependent and moving average environments.
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.