Advanced search
Publication Cover
Communications in Statistics - Theory and Methods Volume 46, 2017 - Issue 16
Submit an article Journal homepage
111
Views
6
CrossRef citations to date
0
Altmetric
Original Articles

The definition of tree-indexed Markov chains in random environment and their existence

Zhiyan ShiFaculty of Science, Jiangsu University, Jiangsu, ChinaCorrespondence[email protected]
&
Weiguo YangFaculty of Science, Jiangsu University, Jiangsu, China
Pages 7934-7941 | Received 09 Apr 2015, Accepted 14 Mar 2016, Published online: 21 Apr 2017

References

  • Benjamini, I., Peres, Y. (1994). Markov chains indexed by trees. Ann. Probab. 22:219–243.
  • Berger, T., Ye, Z. (1990). Entropic aspects of random fields on trees. IEEE Trans. Inf. Theory 36:1006–1018.
  • Chen, X.X., Yang, W.G., Wang, B. (2012). The equivalent definition of T-indexed Markov chains. J. Math. Study 45(4):411–414 (In Chinese).
  • Cogburn, R. (1984). The ergodic theory of Markov chains in random environments. Z. Wahrsch Verw Gebiete 66:109–128.
  • Cogburn, R. (1990). On direct convergence and periodicity for transition probabilities of Markov chains in random environments. Ann. Probab. 18(2):642–654.
  • Cogburn, R. (1991). On the central limit theorem for Markov chains in random environments. Ann. Probab. 19(2):587–604.
  • Hu, D.H. (2004a). The construction of Markov processes in random environments and the equivalence theorems. Sci. China Ser. A 47:481–496.
  • Hu, D.H. (2004b). The existence and uniqueness of q-processes in random environments. Sci. China Ser. A 47:641–658.
  • Huang, H.L., Yang, W.G. (2008). Strong law of large number for Markov chains indexed by an infinite tree with uniformly bounded degree. Sci. China 51(2):195–202.
  • Li, Y.Q. (2003). Instantaneous and invariant functions for Markov chains in double infinite environment. Ann. Math. 24(2):515–520 (In Chinese).
  • Li, Y.Q., Wang, S.M., Hu, Y.L. (2008). A class of strong limit theorems for Markov chains in Markov Environments. Prog. Math. 37(5):543–550 (In Chinese).
  • Nawrotzki, K. (1981). Discrete open system or Markov chains in a random environment I. J. Inf. Process Cybernet 17:569–599.
  • Nawrotzki, K. (1982). Discrete open system or Markov chains in a random environment, II. J. Inf. Process. Cybernet 18:83–98.
  • Pemantle, R. (1992). Antomorphism invariant measure on trees. Ann. Probab. 20:1549–1566.
  • Shi, Z.Y., Yang, W.G. (2008). A limit property of random transition probability for a nonhomogeneous Markov chains indexed by a tree. Acta Mathematicae Applicatae Since 31(4):648–653. (In Chinese)
  • Shi, Z.Y., Yang, W.G. (2008). A limit property of random transition probability for a nonhomogeneous Markov chains indexed by a tree. ACTA Mathematicae Applicatae Sinica 3(4):648–653 (In Chinese).
  • Wang, B., Yang, W.G., Shi, Z.Y. (2012). Strong laws of large numbers for countable Markov chains indexed by a Cayley tree. Sci. China 42(10):1031–1036.
  • Yang, W.G. (2003). Some limit properties for Markov chains indexed by a homogeneous tree. Stat. Probab. Lett. 65:241–250.
  • Yang, W.G., Liu, W. (2000). Strong law of large numbers for Markov chains fields on a Bethe tree. Stat. Probab. Lett. 49:245–250.
  • Yang, W.G., Ye, Z. (2007). The Asymptotic Equipartition property for Markov chains indexed by a Homogeneous tree. IEEE Trans. Inf. Theory 53(9):3275–3280.
  • Ye, Z., Berger, T. (1996). Ergodic, regulary and asymptotic equipartition property of random fields on trees. J. Comb. Inf. Syst. Sci. 21:157–184.
  • Ye, Z., Berger, T. (1998). Information Measures for Discrete Random Fields. Beijing: Science.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.