Law of the Iterated Logarithm for the random walk on the infinite percolation cluster

Abstract

We show that random walks on the infinite supercritical percolation clusters in Z^d satisfy the usual Law of the Iterated Logarithm. The proof combines Barlow's Gaussian heat kernel estimates and the ergodicity of the random walk on the environment viewed from the random walker as derived by Berger and Biskup.

arXiv comment10 pages

Cited by in corpus (4)

• Recent progress on the Random Conductance Model
• Lower Gaussian heat kernel bounds for the Random Conductance Model in a degenerate ergodic environment
• Laws of the Iterated Logarithm for random walks on Random Conductance Models
• Rate functions for random walks on Random conuctance Models and related topics