• DocumentCode
    1554276
  • Title

    Strong law of large numbers and Shannon-McMillan theorem for Markov chain fields on trees

  • Author

    Yang, Weiguo ; Liu, Wen

  • Author_Institution
    Jiangsu Univ. of Sci. & Technol., Zhenjiang, China
  • Volume
    48
  • Issue
    1
  • fYear
    2002
  • fDate
    1/1/2002 12:00:00 AM
  • Firstpage
    313
  • Lastpage
    318
  • Abstract
    We study the strong law of large numbers and the Shannon-McMillan theorem for Markov chain fields on trees. First, we prove the strong law of large numbers for the frequencies of occurrence of states and ordered couples of states for Markov chain fields on trees. Then, we prove the Shannon-McMillan theorem with almost everywhere (a.e.) convergence for Markov chain fields on trees. We prove the results on a Bethe tree and then just state the analogous results on a rooted Cayley tree. In the proof, a new technique for establishing the strong limit theorem in probability theory is applied
  • Keywords
    Markov processes; convergence of numerical methods; number theory; probability; trees (mathematics); Bethe tree; Markov chain fields; Shannon-McMillan theorem; convergence; probability theory; rooted Cayley tree; strong law of large numbers; strong limit theorem; Binary trees; Channel capacity; Codes; Information theory; Joining processes; Memoryless systems; Notice of Violation; Reliability theory; Testing; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.971762
  • Filename
    971762