IDEAS home Printed from https://ideas.repec.org/a/spr/jotpro/v27y2014i2d10.1007_s10959-012-0468-6.html
   My bibliography  Save this article

On Hidden Markov Processes with Infinite Excess Entropy

Author

Listed:
  • Łukasz Dębowski

    (Polish Academy of Sciences)

Abstract

We investigate stationary hidden Markov processes for which mutual information between the past and the future is infinite. It is assumed that the number of observable states is finite and the number of hidden states is countably infinite. Under this assumption, we show that the block mutual information of a hidden Markov process is upper bounded by a power law determined by the tail index of the hidden state distribution. Moreover, we exhibit three examples of processes. The first example, considered previously, is nonergodic and the mutual information between the blocks is bounded by the logarithm of the block length. The second example is also nonergodic but the mutual information between the blocks obeys a power law. The third example obeys the power law and is ergodic.

Suggested Citation

  • Łukasz Dębowski, 2014. "On Hidden Markov Processes with Infinite Excess Entropy," Journal of Theoretical Probability, Springer, vol. 27(2), pages 539-551, June.
    • Handle: RePEc:spr:jotpro:v:27:y:2014:i:2:d:10.1007_s10959-012-0468-6
    DOI: 10.1007/s10959-012-0468-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10959-012-0468-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10959-012-0468-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bialek, William & Nemenman, Ilya & Tishby, Naftali, 2001. "Complexity through nonextensivity," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 302(1), pages 89-99.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dingle, Kamaludin & Kamal, Rafiq & Hamzi, Boumediene, 2023. "A note on a priori forecasting and simplicity bias in time series," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    2. Ghosh, Abhik, 2023. "Optimal guessing under nonextensive framework and associated moment bounds," Statistics & Probability Letters, Elsevier, vol. 197(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jotpro:v:27:y:2014:i:2:d:10.1007_s10959-012-0468-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.