Analyticity of Entropy Rate of Hidden Markov Chains
<|reference_start|>Analyticity of Entropy Rate of Hidden Markov Chains: We prove that under mild positivity assumptions the entropy rate of a hidden Markov chain varies analytically as a function of the underlying Markov chain parameters. A general principle to determine the domain of analyticity is stated. An example is given to estimate the radius of convergence for the entropy rate. We then show that the positivity assumptions can be relaxed, and examples are given for the relaxed conditions. We study a special class of hidden Markov chains in more detail: binary hidden Markov chains with an unambiguous symbol, and we give necessary and sufficient conditions for analyticity of the entropy rate for this case. Finally, we show that under the positivity assumptions the hidden Markov chain {\em itself} varies analytically, in a strong sense, as a function of the underlying Markov chain parameters.<|reference_end|>
@article{han2005analyticity,
    title={Analyticity of Entropy Rate of Hidden Markov Chains},
    author={Guangyue Han, Brian Marcus},
    journal={arXiv preprint arXiv:math/0507235},
    year={2005},
    archivePrefix={arXiv},
    eprint={math/0507235},
    primaryClass={math.PR cs.IT math.IT}
}