|
This article is cited in 14 scientific papers (total in 14 papers)
Short Communications
An entropy estimator for a class of infinite alphabet processes
A. N. Quas Department of pure mathematics and mathematical statistics, University of Cambridge, England
Abstract:
Motivated by recent work by Kontoyiannis and Suhov, and by Shields, we present an entropy estimator which works for a class of ergodic finite entropy infinite symbol processes for which the entropy of the time-zero partition is finite, and which satisfy a “Doeblin condition”. The results are then extended to random fields indexed by $\mathbb{Z}^d$.
Keywords:
entropy estimator, prefixes.
Received: 14.07.1997
Citation:
A. N. Quas, “An entropy estimator for a class of infinite alphabet processes”, Teor. Veroyatnost. i Primenen., 43:3 (1998), 610–621; Theory Probab. Appl., 43:3 (1998), 496–507
Linking options:
https://www.mathnet.ru/eng/tvp1566https://doi.org/10.4213/tvp1566 https://www.mathnet.ru/eng/tvp/v43/i3/p610
|
Statistics & downloads: |
Abstract page: | 254 | Full-text PDF : | 162 | First page: | 11 |
|