Hostname: page-component-586b7cd67f-r5fsc Total loading time: 0 Render date: 2024-11-22T19:11:14.238Z Has data issue: false hasContentIssue false

SOME STRONG LIMIT THEOREMS FOR MARKOV CHAIN FIELDS ON TREES

Published online by Cambridge University Press:  01 July 2004

Wen Liu
Affiliation:
Department of Mathematics, Hebei University of Technology, Tianjin 300130, China
Weiguo Yang
Affiliation:
Faculty of Science, Jiangsu University, Zhenjiang 212013, China, E-mail: [email protected]

Abstract

In this article, we introduce the notion of the Markov chain fields on the generalized Bethe trees or generalized Cayley trees, and some strong limit theorems on the frequencies of states and ordered couples of states, including the Shannon–McMillan theorem on Bethe tree TB,N and Cayley tree TC,N, are obtained. In the proof, a new technique in the study of the strong limit theorem in probability theory is applied.

Type
Research Article
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Benjamini, I. & Peres, Y. (1994). Markov chains indexed by trees. Annals of Probability 22: 219243.Google Scholar
Berger, T. & Ye, Z. (1990). Entropic aspects of random fields on trees. IEEE Transactions on Information Theory 36(5): 10061018.Google Scholar
Feller, W. (1968). An introduction to probability theory and its applications, Vol. 1, 3rd ed. New York: Wiley.
Liu, W. & Yang, W. G. (1995). A limit theorem for the entropy density of nonhomogeneous Markov information source. Statistics and Probability Letters 22: 295301.Google Scholar
Liu, W. & Yang, W. G. (1996). An extension of Shannon–McMillan theorem and some limit properties for nonhomogeneous Markov chains. Stochastic Processes and Their Applications 61: 129146.Google Scholar
Spitzer, F. (1975). Markov random fields on an infinite tree. Annals of Probability 3: 387398.Google Scholar
Ye, Z. & Berger, T. (1996). Ergodic, regularity and asymptotic equipartition property of random fields on trees. Journal of Combinatorics, Information and System Sciences 21(2): 157184.Google Scholar