2007
DOI: 10.1080/03610920701270964
|View full text |Cite
|
Sign up to set email alerts
|

Estimation of the Entropy Rate of a Countable Markov Chain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
39
0
4

Year Published

2008
2008
2024
2024

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 35 publications
(44 citation statements)
references
References 21 publications
1
39
0
4
Order By: Relevance
“…See also Girardin and Sesboüé (2009) for a detailed study of such estimators for two-state Markov chains. For ergodic continuous-time processes, Regnault (2009) established the good asymptotic behavior of plug-in estimators of the entropy of the stationary distribution of a two-state continuous-time ergodic Markov process, by extending the methods developed by Ciuperca and Girardin (2007) to continuous-time processes.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…See also Girardin and Sesboüé (2009) for a detailed study of such estimators for two-state Markov chains. For ergodic continuous-time processes, Regnault (2009) established the good asymptotic behavior of plug-in estimators of the entropy of the stationary distribution of a two-state continuous-time ergodic Markov process, by extending the methods developed by Ciuperca and Girardin (2007) to continuous-time processes.…”
Section: Introductionmentioning
confidence: 99%
“…Due to the few assumptions made on the sequences, the behavior of the estimators remains partly unknown. Ciuperca and Girardin (2007) computed plug-in estimators of the entropy of the stationary distribution of a finite-state ergodic Markov chain. For such a sequence, the stationary distribution is an explicit function of the transition probability distributions.…”
Section: Introductionmentioning
confidence: 99%
“…An entropy rate approach has been adopted for selecting the alphabet size [23]. Let h(M (k) ) denote the entropy rate of the transition matrix for iteration k [4].…”
Section: Comparaison Between Different Partition Methodsmentioning
confidence: 99%
“…In particular, the determination of the asymptotic variances of the estimators allows us to construct the confidence set of the rewards for each significance level. The goal is achieved developing the techniques of estimation for Markov chains, presented in Billingsley (1960), in Sadek and Limnios (2002), in Limnios et al (2004) and Ciuperca and Girardin (2007) together with results in nonparametric empirical estimation. Gardiner et al (2006) and Gardiner et al (2008) considered estimators of the first moment of a nonhomogeneous Markov reward process with deterministic reward functions.…”
Section: Introductionmentioning
confidence: 99%