A limit theorem for the entropy density of nonhomogeneous Markov information source

Liu Wen and Yang Weiguo

Statistics & Probability Letters, 1995, vol. 22, issue 4, 295-301

Abstract: Let Xn, n [greater-or-equal, slanted] 0 be a sequence of successive letters produced by a nonhomogeneous Markov information source with alphabet S = 1,2, ...,m, and the probability distribution p(x0)[Pi]kn = 1 pk(xk-1, xk), where pk(i,j) is the transition probability P(Xk = jXk-1 = i). Let fn([omega]) be the relative entropy density of Xk, 0 [less-than-or-equals, slant] k [less-than-or-equals, slant] n. In this paper we prove that for an arbitrary nonhomogeneous Markov information source, fn([omega]) and (1/n)[Sigma]k = 1n H[pk(Xk-1, 1), ..., pk(Xk-1, m)] are asymptotically equal almost everywhere as n --> [infinity], where H(p1, ..., pm) is the entropy of the distribution p1, ..., pm.

Keywords: Nonhomogeneous; Markov; information; source; Relative; entropy; density; a.e.; convergence (search for similar items in EconPapers)
Date: 1995
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0167-7152(94)00080-R
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:stapro:v:22:y:1995:i:4:p:295-301

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Statistics & Probability Letters is currently edited by Somnath Datta and Hira L. Koul

More articles in Statistics & Probability Letters from Elsevier
Bibliographic data for series maintained by Catherine Liu ().