S.L.L.N. and C.L.T. for Random Walks in I.I.D. Random Environment on Cayley Trees
Probability
2020-01-28 v1
Abstract
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of and . Such a Cayley graph is readily seen to be a regular tree. Under a uniform elipticity assumption on the i.i.d. environment we show that the walk has positive speed and establish the annealed central limit theorem for the graph distance of the walker from the starting point.
Keywords
Cite
@article{arxiv.2001.09628,
title = {S.L.L.N. and C.L.T. for Random Walks in I.I.D. Random Environment on Cayley Trees},
author = {Siva Athreya and Antar Bandyopadhyay and Amites Dasgupta and Neeraja Sahasrabudhe},
journal= {arXiv preprint arXiv:2001.09628},
year = {2020}
}
Comments
14 pages. arXiv admin note: text overlap with arXiv:1307.3353