Asymptotic entropy of random walks on regular languages over a finite alphabet

被引：2
|
作者：
Gilch, Lorenz A. [1 ]
机构：
[1] Graz Univ Technol, A-8010 Graz, Austria
来源：
ELECTRONIC JOURNAL OF PROBABILITY | 2016年 / 21卷
关键词：
random walks; regular languages; entropy; analytic; CONTEXT-FREE PAIRS; HYPERBOLIC GROUPS; MARKOV-CHAINS; ANALYTICITY; ENDS;
D O I：
10.1214/16-EJP4180
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant support, which describe the random walk. This setting applies, in particular, to random walks on virtually free groups.
引用
收藏
页数：42
相关论文
共 50 条
12345