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

DOI10.1214/16-EJP4180MaRDI QIDQ287693zbMATH OpenOpenAlexFDO

Authors Lorenz Gilch

Publication date 23 May 2016

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

Full work available at URL https://arxiv.org/abs/1304.3555, https://projecteuclid.org/euclid.ejp/1454682889

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)

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.

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

Cited in

(10)

• Asymptotic entropy of the ranges of random walks on discrete groups
• Cutoff for random lifts of weighted graphs
• Hausdorff spectrum of harmonic measure
• Rate of escape of random walks on regular languages and free products by amalgamation of finite groups
• Asymptotic Rényi entropies of random walks on groups
• Asymptotic word length of random walks on HNN extensions
• On the entropy of regular languages.
• scientific article; zbMATH DE number 1894276 (Why is no real title available?)
• scientific article; zbMATH DE number 2128194 (Why is no real title available?)
• 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)