Relative complexity of random walks in random scenery in the absence of a weak invariance principle for the local times
We answer a 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 t...
Main Authors: | Deligiannidis, G, Kosloff, Z |
---|---|
Format: | Journal article |
Published: |
Institute of Mathematical Statistics
2017
|
Similar Items
-
An asymptotic variance of the self-intersections of random walks
by: Deligiannidis, G, et al.
Published: (2010) -
Random walks on graphs and approximation of L²-Invariants
by: Kricker, Andrew, et al.
Published: (2022) -
Strong and weak random walks on signed networks
by: Babul, SA, et al.
Published: (2025) -
Invariance principle for the random conductance model
by: Andres, S, et al.
Published: (2013) -
Invariance principle for the random conductance model
by: Andres, S, et al.
Published: (2013)