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

DOI10.1214/16-EJP4180zbMATH Open1338.60124arXiv1304.3555OpenAlexW2962947850MaRDI QIDQ287693FDOQ287693

Authors: Lorenz Gilch 

Publication date: 23 May 2016

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1304.3555

Recommendations

• Asymptotic entropy of random walks on free products
• Regularity of the entropy for random walks on hyperbolic groups
• Rate of escape of random walks on regular languages and free products by amalgamation of finite groups
• scientific article; zbMATH DE number 1894276
• Asymptotic entropy of the ranges of random walks on discrete groups

zbMATH Keywords

random walksasymptotic entropyfinite alphabetregular languages

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Sums of independent random variables; random walks (60G50) Entropy and other invariants (28D20)

Cited In (7)

• Cutoff for random lifts of weighted graphs
• Hausdorff spectrum of harmonic measure
• Asymptotic Word Length of Random Walks on HNN Extensions
• On the entropy of regular languages.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Asymptotic entropy of random walks on Fuchsian buildings and Kac-Moody groups

This page was built for publication: Asymptotic entropy of random walks on regular languages over a finite alphabet

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287693)