Laws of the Iterated Logarithm for random walks on Random Conductance Models

Abstract

We derive laws of the iterated logarithm for random walks on random conductance models under the assumption that the random walks enjoy long time sub-Gaussian heat kernel estimates.

arXiv comment12 pages

References in corpus (9)

• Quenched invariance principle for simple random walk on percolation clusters
• Random walks on supercritical percolation clusters
• Recent progress on the Random Conductance Model
• Phase transition and level-set percolation for the Gaussian free field
• On the uniqueness of the infinite cluster of the vacant set of random interlacements
• Harnack inequalities on weighted graphs and some applications to the random conductance model
• Law of the Iterated Logarithm for the random walk on the infinite percolation cluster
• Lamplighter random walks on fractals
• Rate functions for random walks on Random conuctance Models and related topics

Cited by in corpus (2)

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