Relative Complexity of Random Walks in Random Scenery in the absence of a weak invariance principle for the local times
classification
🧮 math.PR
math.DS
keywords
randomwalksaperiodiccomplexityrelativewalkaaronsonabsence
read the original abstract
We answer the question of Aaronson about the relative complexity of Random Walks in Random Sceneries driven by either aperiodic two dimensional random walks, two-dimensional Simple Random walk, or by aperiodic random walks in the domain of attraction of the Cauchy distribution. A key step is proving that the range of the random walk satisfies the F\"olner property almost surely.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.