Properties of the Statistical Complexity Functional and Partially Deterministic HMMs

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 low...

Full description

Bibliographic Details
Main Author: Wolfgang Löhr
Format: Article
Language:English
Published: MDPI AG 2009-08-01
Series:Entropy
Subjects:
Online Access:http://www.mdpi.com/1099-4300/11/3/385/
_version_ 1817991294455119872
author Wolfgang Löhr
author_facet Wolfgang Löhr
author_sort Wolfgang Löhr
collection DOAJ
description 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.
first_indexed 2024-04-14T01:10:34Z
format Article
id doaj.art-a8c687aaf98d4d2484ef813b980c4ec0
institution Directory Open Access Journal
issn 1099-4300
language English
last_indexed 2024-04-14T01:10:34Z
publishDate 2009-08-01
publisher MDPI AG
record_format Article
series Entropy
spelling doaj.art-a8c687aaf98d4d2484ef813b980c4ec02022-12-22T02:21:04ZengMDPI AGEntropy1099-43002009-08-0111338540110.3390/e110300385Properties of the Statistical Complexity Functional and Partially Deterministic HMMsWolfgang LöhrStatistical 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.http://www.mdpi.com/1099-4300/11/3/385/statistical complexitylower semi-continuityergodic decompositionconcavityprediction processpartially deterministic hidden Markov models (HMMs)
spellingShingle Wolfgang Löhr
Properties of the Statistical Complexity Functional and Partially Deterministic HMMs
Entropy
statistical complexity
lower semi-continuity
ergodic decomposition
concavity
prediction process
partially deterministic hidden Markov models (HMMs)
title Properties of the Statistical Complexity Functional and Partially Deterministic HMMs
title_full Properties of the Statistical Complexity Functional and Partially Deterministic HMMs
title_fullStr Properties of the Statistical Complexity Functional and Partially Deterministic HMMs
title_full_unstemmed Properties of the Statistical Complexity Functional and Partially Deterministic HMMs
title_short Properties of the Statistical Complexity Functional and Partially Deterministic HMMs
title_sort properties of the statistical complexity functional and partially deterministic hmms
topic statistical complexity
lower semi-continuity
ergodic decomposition
concavity
prediction process
partially deterministic hidden Markov models (HMMs)
url http://www.mdpi.com/1099-4300/11/3/385/
work_keys_str_mv AT wolfganglohr propertiesofthestatisticalcomplexityfunctionalandpartiallydeterministichmms