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

作者：Gilch Lorenz A^*

来源：Electronic Journal of Probability, 2016, 21(0): 8.

DOI：10.1214/16-EJP4180

• random walks
• regular languages
• entropy
• analytic

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.

• 出版日期2016