Asymptotic Entropy of Random Walks on Regular Languages over a Finite Alphabet
Probability
2015-03-11 v2
Abstract
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.
Keywords
Cite
@article{arxiv.1304.3555,
title = {Asymptotic Entropy of Random Walks on Regular Languages over a Finite Alphabet},
author = {Lorenz A. Gilch},
journal= {arXiv preprint arXiv:1304.3555},
year = {2015}
}
Comments
47 pages, 2 figures