On favourite sites of a random walk in moderately sparse random environment
Alicja Ko{\l}odziejska

TL;DR
This paper investigates the behavior of a symmetric random walk in a sparse random environment, focusing on its favorite sites and how the environment's sparsity influences the walk's long-term distribution and limiting behavior.
Contribution
It extends known results for i.i.d. environments to sparse environments and uncovers new behaviors caused by environment sparsity.
Findings
Limit theorems for favorite sites in different environmental regimes
Generalization of known results to sparse environments
Discovery of new behavior due to environment sparsity
Abstract
We study the favourite sites of a random walk evolving in a sparse random environment on the set of integers. The walker moves symmetrically apart from some randomly chosen sites where we impose random drift. We prove annealed limit theorems for the time the walk spends in its favourite sites in two cases. The first one, in which it is the distribution of the drift that determines the limiting behaviour of the walk, is a generalization of known results for a random walk in i.i.d. random environment. In the second case a new behaviour appears, caused by the sparsity of the environment.
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
TopicsComplex Network Analysis Techniques
