Almost sure estimates for the concentration neighborhood of Sinai's walk
Pierre Andreoletti
Abstract
We consider Sinai's random walk in random environment. We prove that infinitely often (i.o.) the size of the concentration neighborhood of this random walk is almost surely bounded. As an application we get that i.o. the maximal distance between two favorite sites is almost surely bounded.
Create a lesson
Related papers
Almost sure exponential stability of multi-dimensional stochastic systems driven by a symmetric α-stable process
Xuekang Zhang, Hongjian Liu, Guangjun Shen
The Arc Threshold of the Two-Row Ising Torus: Exact Factorization, an Algebraic Critical Coupling, Uniformity in the Circumference, and the Rate of Convergence
Marco Mandap
Markovian Lifts and Multifactor Approximations for Weighted Sub-fractional Brownian Motion
J. H. Ramirez-Gonzalez, Edison Cuba
Rényi mixing bounds for kinetic samplers via L2 hypocoercivity
Jianfeng Lu, Yinchen Luo
Bayesian Filters via the Stochastic Category
Kenichi Bannai, Masahiro Kurisaki
Synchronization of Enriched Spin Glasses
Franziska Engler, Justin Ko