On hidden Markov processes with infinite excess entropy (Q2248935): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Łukasz Dębowski / rank
Normal rank
 
Property / author
 
Property / author: Łukasz Dębowski / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ITIP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2951192963 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59397816 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1211.0834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity through nonextensivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularities unseen, randomness observed: Levels of entropy convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong mixing and weak Bernoulli conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3563047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general definition of conditional information and its application to ergodic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-length coding of two-sided asymptotically mean stationary measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excess entropy in natural language: Present state and perspectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing, Ergodic, and Nonergodic Processes With Rapidly Growing Information Between Blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction and entropy of nonlinear dynamical systems and symbolic sequences with LRO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prediction, retrodiction, and the amount of information stored in the present / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hidden Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the covariance determinants of moving-average and autoregressive models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entropy of the symbolic sequence for critical circle maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3247378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5518968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of the statistical complexity functional and partially deterministic HMMs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information accessibility and cryptic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational mechanics: pattern and prediction, structure and simplicity. / rank
 
Normal rank

Latest revision as of 17:17, 8 July 2024

scientific article
Language Label Description Also known as
English
On hidden Markov processes with infinite excess entropy
scientific article

    Statements

    On hidden Markov processes with infinite excess entropy (English)
    0 references
    27 June 2014
    0 references
    The author considers discrete stationary hidden Markov processes for which mutual information between the past and the future, measured by excess entropy, is infinite. It is assumed that the number of observable states is finite and the number of hidden states is countably infinite. The author shows that, under these conditions, the block mutual information of a hidden Markov process is upper bounded by a power law determined by the tail index of the hidden states distribution. Three examples of processes are considered. The first two examples are nonergodic and the mutual information between the blocks is bounded by the logarithm of the block length (in the first example) and obeys a power law (in the second one). The third example is ergodic, with power law of the mutual information.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hidden Markov processes
    0 references
    mutual information
    0 references
    ergodic processes
    0 references
    0 references
    0 references
    0 references
    0 references