Asymptotic entropy of the ranges of random walks on discrete groups

被引:2
|
作者
Chen, Xinxing [1 ,2 ]
Xie, Jiansheng [2 ,3 ]
Zhao, Minzhi [2 ,4 ]
机构
[1] Shanghai Jiao Tong Univ, Sch Math Sci, Shanghai 200240, Peoples R China
[2] Fudan Univ, Shanghai Ctr Math, Shanghai 200433, Peoples R China
[3] Fudan Univ, Sch Math Sci, Shanghai 200433, Peoples R China
[4] Zhejiang Univ, Sch Math Sci, Hangzhou 310027, Peoples R China
基金
中国国家自然科学基金;
关键词
random walk; entropy; range; recurrent; ITERATED LOGARITHM; RECURRENCE; TRANSIENT; BOUNDARY; TRACE;
D O I
10.1007/s11425-017-9369-6
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Inspired by Benjamini et al. (2010) and Windisch (2010), we consider the entropy of the random walk ranges Rn formed by the first n steps of a random walk S on a discrete group. In this setting, we show the existence of hR := limn1 H(Rn) n called the asymptotic entropy of the ranges. A sample version of the above statement in the sense of Shannon (1948) is also proved. This answers a question raised by Windisch (2010). We also present a systematic characterization of the vanishing asymptotic entropy of the ranges. Particularly, we show that hR = 0 if and only if the random walk either is recurrent or escapes to negative infinity without left jump. By introducing the weighted digraphs formed by the underlying random walk, we can characterize the recurrence property of S as the vanishing property of the quantity limn!1 H(n, which is an analogue of h(R).
引用
收藏
页码:1153 / 1168
页数:16
相关论文
共 50 条