IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v52y2023i8p2562-2573.html
   My bibliography  Save this article

Shannon-McMillan theorem and strong law of large numbers for Markov chains indexed by generalized spherically symmetric trees

Author

Listed:
  • Weicai Peng
  • Xinyue Xi

Abstract

In this paper, we investigate some strong limit properties for Markov chains indexed by a class of infinite trees, which are the generalizations of the spherically symmetric tree. We first give the definition of the generalized spherically symmetric tree model, then obtain the strong law of large numbers for Markov chain indexed by such tree. Finally, we establish the Shannon-McMillan theorem for Markov chains indexed by generalized spherically symmetric tree by applying the Stolz theorem. The obtained properties are generalizations of some known results in the existing literature.

Suggested Citation

  • Weicai Peng & Xinyue Xi, 2023. "Shannon-McMillan theorem and strong law of large numbers for Markov chains indexed by generalized spherically symmetric trees," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 52(8), pages 2562-2573, April.
    • Handle: RePEc:taf:lstaxx:v:52:y:2023:i:8:p:2562-2573
    DOI: 10.1080/03610926.2021.1955385
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2021.1955385
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/03610926.2021.1955385?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:lstaxx:v:52:y:2023:i:8:p:2562-2573. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    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.