Open Access
Translator Disclaimer
2016 Asymptotic entropy of random walks on regular languages over a finite alphabet
Lorenz A. Gilch
Electron. J. Probab. 21: 1-42 (2016). DOI: 10.1214/16-EJP4180

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.

Citation

Download Citation

Lorenz A. Gilch. "Asymptotic entropy of random walks on regular languages over a finite alphabet." Electron. J. Probab. 21 1 - 42, 2016. https://doi.org/10.1214/16-EJP4180

Information

Received: 19 March 2015; Accepted: 19 January 2016; Published: 2016
First available in Project Euclid: 5 February 2016

zbMATH: 1338.60124
MathSciNet: MR3485350
Digital Object Identifier: 10.1214/16-EJP4180

Subjects:
Primary: 60J10
Secondary: 28D20

Keywords: analytic , Entropy , Random walks , regular languages

JOURNAL ARTICLE
42 PAGES


SHARE
Vol.21 • 2016
Back to Top