Properties of the statistical complexity functional and partially deterministic HMMs (Q845416): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.3390/e110300385 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2046755574 / rank | |||
Normal rank |
Revision as of 21:57, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Properties of the statistical complexity functional and partially deterministic HMMs |
scientific article |
Statements
Properties of the statistical complexity functional and partially deterministic HMMs (English)
0 references
29 January 2010
0 references
Summary: Statistical complexity is a measure of complexity of discrete-time stationary stochastic processes, which has many applications. We investigate its more abstract properties as a non-linear function of the space of processes and show its close relation to the Knight's prediction process. We prove lower semi-continuity, concavity, and a formula for the ergodic decomposition of statistical complexity. On the way, we show that the discrete version of the prediction process has a continuous Markov transition. We also prove that, given the past output of a partially deterministic hidden Markov model (HMM), the uncertainty of the internal state is constant over time and knowledge of the internal state gives no additional information on the future output. Using this fact, we show that the causal state distribution is the unique stationary representation on prediction space that may have finite entropy.
0 references
statistical complexity
0 references
lower semi-continuity
0 references
ergodic decomposition
0 references
concavity
0 references
prediction process
0 references
partially deterministic hidden Markov models (HMMs)
0 references