Stable limit laws for random walk in a sparse random environment I: moderate sparsity
Dariusz Buraczewski, Piotr Dyszewski, Alexander Iksanov, Alexander, Marynych, Alexander Roitershtein

TL;DR
This paper establishes stable limit laws for a random walk in a moderately sparse environment, extending previous work to cases where the environment's sparsity has finite mean, revealing new asymptotic behaviors.
Contribution
It derives stable limit laws for the walk in environments with finite mean sparsity, broadening understanding beyond previous weak sparsity cases.
Findings
Established stable limit laws for moderate sparsity
Extended analysis to environments with finite mean sparsity
Provided groundwork for future study of strong sparsity cases
Abstract
A random walk in a sparse random environment is a model introduced by Matzavinos et al. [Electron. J. Probab. 21, paper no. 72: 2016] as a generalization of both a simple symmetric random walk and a classical random walk in a random environment. A random walk in a sparse random environment is a nearest neighbor random walk on that jumps to the left or to the right with probability from every point of and jumps to the right (left) with the random probability () from the point , . Assuming that are independent copies of a random vector and the mean is finite (moderate sparsity) we obtain…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Probability and Risk Models · Markov Chains and Monte Carlo Methods
