Title: Analyticity of Entropy Rate in Families of Hidden Markov Chains (II)
Abstract: We give relaxed sufficient conditions (compared to [2]) for analyticity of the entropy rate of a hidden Markov chain. Several examples of the relaxed conditions are given. A general principle to calculate the domain of analyticity is stated. An example is given to estimate the radius of convergence for the entropy rate. Finally, we prove a ``stabilizing'' property of ``Black Hole'' case, which suggests that one can explicitly compute the derivatives and obtain an explicit Taylor series in certain cases, generalizing the results in [13, 12].
Publication Year: 2006
Publication Date: 2006-03-14
Language: en
Type: preprint
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot