Entropy of Hidden Markov Processes and Connections to Dynamical Systems Book contents
- Frontmatter
- Contents
- Introduction
- 1 Hidden Markov processes in the context of symbolic dynamics
- 2 On the preservation of Gibbsianness under symbol amalgamation
- 3 A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes
- 4 Bounds on the entropy rate of binary hidden Markov processes
- 5 Entropy rate for hidden Markov chains with rare transitions
- 6 The capacity of finite-state channels in the high-noise regime
- 7 Computing entropy rates for hidden Markov processes
- 8 Factors of Gibbs measures for full shifts
- 9 Thermodynamics of hidden Markov processes
3 - A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes
Published online by Cambridge University Press: 05 June 2011
- Frontmatter
- Contents
- Introduction
- 1 Hidden Markov processes in the context of symbolic dynamics
- 2 On the preservation of Gibbsianness under symbol amalgamation
- 3 A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes
- 4 Bounds on the entropy rate of binary hidden Markov processes
- 5 Entropy rate for hidden Markov chains with rare transitions
- 6 The capacity of finite-state channels in the high-noise regime
- 7 Computing entropy rates for hidden Markov processes
- 8 Factors of Gibbs measures for full shifts
- 9 Thermodynamics of hidden Markov processes
Summary
Abstract. In this article, we show that small complex perturbations of positive matrices are contractions, with respect to a complex version of the Hilbert metric, on a neighborhood of the interior of the real simplex within the complex simplex. We show that this metric can be used to obtain estimates of the domain of analyticity of the entropy rate for a hidden Markov process when the underlying Markov chain has strictly positive transition probabilities.
Introduction
The purpose of this article is twofold. First, in Section 2, we introduce a new complex version of the Hilbert metric on the standard real simplex. This metric is defined on a complex neighborhood of the interior of the standard real simplex, within the standard complex simplex. We show that if the neighborhood is sufficiently small, then any sufficiently small complex perturbation of a strictly positive square matrix acts as a contraction, with respect to this metric. While this article was nearing completion, we were informed of a different complex Hilbert metric, which was recently introduced. We briefly discuss the relation between this metric [3] and our metric in Remark 2.7.
Secondly, we show how one can use a complex Hilbert metric to obtain lower estimates of the domain of analyticity of the entropy rate for a hidden Markov process when the underlying Markov chain has strictly positive transition probabilities.
- Type
- Chapter
- Information
- Entropy of Hidden Markov Processes and Connections to Dynamical SystemsPapers from the Banff International Research Station Workshop, pp. 98 - 116Publisher: Cambridge University PressPrint publication year: 2011
- 3
- Cited by