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

被引：2
|
作者：
Gilch, Lorenz A. [1 ]
机构：
[1] Graz Univ Technol, A-8010 Graz, Austria
来源：
ELECTRONIC JOURNAL OF PROBABILITY | 2016年 / 21卷
关键词：
random walks; regular languages; entropy; analytic; CONTEXT-FREE PAIRS; HYPERBOLIC GROUPS; MARKOV-CHAINS; ANALYTICITY; ENDS;
D O I：
10.1214/16-EJP4180
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
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.
引用
收藏
页数：42
相关论文
共 50 条
  • [1] Asymptotic entropy of transformed random walks
    Forghani, Behrang
    ERGODIC THEORY AND DYNAMICAL SYSTEMS, 2017, 37 : 1480 - 1491
  • [2] Asymptotic Entropy of Random Walks on Free Products
    Gilch, Lorenz A.
    ELECTRONIC JOURNAL OF PROBABILITY, 2011, 16 : 73 - 102
  • [3] Asymptotic entropy of the ranges of random walks on discrete groups
    Chen, Xinxing
    Xie, Jiansheng
    Zhao, Minzhi
    SCIENCE CHINA-MATHEMATICS, 2020, 63 (06) : 1153 - 1168
  • [4] Asymptotic entropy of the ranges of random walks on discrete groups
    Xinxing Chen
    Jiansheng Xie
    Minzhi Zhao
    ScienceChina(Mathematics), 2020, 63 (06) : 1153 - 1168
  • [5] Asymptotic entropy of the ranges of random walks on discrete groups
    Xinxing Chen
    Jiansheng Xie
    Minzhi Zhao
    Science China Mathematics, 2020, 63 : 1153 - 1168
  • [6] Languages given by finite automata over the unary alphabet
    Czerwinski, Wojciech
    Debski, Maciej
    Gogasz, Tomasz
    Hoi, Gordon
    Jain, Sanjay
    Skrzypczak, Michal
    Stephan, Frank
    Tan, Christopher
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2025, 151
  • [7] Asymptotic properties of the factors of words over a finite alphabet
    Tomescu, I
    FUNDAMENTA INFORMATICAE, 2005, 64 (1-4) : 463 - 470
  • [8] Asymptotic entropy and Green speed for random walks on countable groups
    Blachere, Sebastien
    Haissinsky, Peter
    Mathieu, Pierre
    ANNALS OF PROBABILITY, 2008, 36 (03): : 1134 - 1152
  • [9] Sharp lower bounds for the asymptotic entropy of symmetric random walks
    Gouezel, Sebastien
    Matheus, Frederic
    Maucourant, Francois
    GROUPS GEOMETRY AND DYNAMICS, 2015, 9 (03) : 711 - 735
  • [10] State complexity of permutation on finite languages over a binary alphabet
    Cho, Da-Jung
    Goc, Daniel
    Han, Yo-Sub
    Ko, Sang-Ki
    Palioudakis, Alexandros
    Salomaa, Kai
    THEORETICAL COMPUTER SCIENCE, 2017, 682 : 67 - 78
12345