Almost sure convergence for stochastically biased random walks on trees
成果类型:
Article
署名作者:
Faraud, Gabriel; Hu, Yueyun; Shi, Zhan
署名单位:
Universite Paris 13; Sorbonne Universite
刊物名称:
PROBABILITY THEORY AND RELATED FIELDS
ISSN/ISSBN:
0178-8051
DOI:
10.1007/s00440-011-0379-y
发表日期:
2012
页码:
621-660
关键词:
transient random-walks
random environment
percolation
BEHAVIOR
THEOREM
摘要:
We are interested in the biased random walk on a supercritical Galton-Watson tree in the sense of Lyons (Ann. Probab. 18:931-958, 1990) and Lyons, Pemantle and Peres (Probab. Theory Relat. Fields 106:249-264, 1996), and study a phenomenon of slow movement. In order to observe such a slow movement, the bias needs to be random; the resulting random walk is then a tree-valued random walk in random environment. We investigate the recurrent case, and prove, under suitable general integrability assumptions, that upon the system's non-extinction, the maximal displacement of the walk in the first n steps, divided by (log n)(3), converges almost surely to a known positive constant.
来源URL: