Entropy Rate and Maximum Entropy Methods for Countable Semi-Markov Chains

Communications in Statistics - Theory and Methods

Volumn 33, Issue 3, 2004, Pages 609-622

  Girardin, Valerie ^a   Limnios, Nikolaos ^b  

^a UNIVERSITÉ DE CAEN   (France)

^b UNIVERSITÉ DE TECHNOLOGIE DE COMPIÈGNE   (France)

Author keywords

Discrete time semi Markov processes; Entropy rate; Maximum entropy methods; Relative entropy; Semi Markov chains

Indexed keywords

INFORMATION THEORY; MATHEMATICAL MODELS; STATISTICAL METHODS; THEOREM PROVING;

DISCRETE TIME SEMI MARKOV PROCESSES; ENTROPY RATE; MAXIMUM ENTROPY METHODS; RELATIVE ENTROPY; SEMI MARKOV CHAINS;

MARKOV PROCESSES;

EID: 1642310853     PISSN: 03610926     EISSN: None     Source Type: Journal    
DOI: 10.1081/STA-120028687     Document Type: Article

References (24)

1. Albert, A. (1962). Estimating the infinitesimal generator of a continuous time finite state Markov process. Ann. Math. Stat. 38:727-753.
2. Anselone, P. M. (1960). Ergodic theory for discrete semi-Markov chains. Duke Math. J. 27:33-40.
3. Bad Dumitrescu, M. (1988). Some informational properties of Markov purejump processes. Cas. Pestovani Mat. 113:429-434.
4. Barbu, V., Limnios, N. (2004). Discrete-time semi-Markov processes for reliability and survival analysis - A nonparametric estimation approach. In: Nikulin, M., Mesbah, M., Balakrishnan, N., Limnios, N., eds. Semiparametric Models and Applications to Reliability Survival Analysis and Quality of Life. Boston: Birkhäuser.
5. Barbu, V., Boussemart, M., Limnios, N. Discrete-time semi-Markov models for reliability and survival analysis. Submitted.
6. Breiman, L. (1957). The individual ergodic theorem of information theory. Ann. Math. Stat. 28:809-811.
7. Breiman, L. (1960). Correction to: The individual ergodic theorem of information theory. Ann. Math. Stat. 31:809-810.
8. Carleson, L. (1958). Two remarks on the basic theorems of information theory. Math. Scand. 6:175-180.
9. Chung, K. L. (1961). A note on the ergodic theorem of information theory. Ann. Math. Stat. 32:612-614.
10. Girardin, V. (2004a). On the different extensions of the ergodic theorem of information theory. In: Glaz, J., Gzyl, H., eds. Applied Probability Recent Advance. Kluwer.
11. Girardin, V. (2004b). Entropy maximization for Markov and semi-Markov processes. MCAP 6:109-127.
12. Girardin, V., Limnios, N. (2003). On the entropy for semi-Markov processes. J. Appl. Probab. 40:1060-1068.
13. Goutsias, J., Mendel, J. M. (1988). Optimal simultaneous detection and estimation of filtered discrete semi-Markov chains. IEEE Trans. Info. Theory 34:551-568.
14. Gut, A. (1988). Stopped Random Walks, Limit Theorems and Applications. New-York: Springer-Verlag.
15. Howard, R. A. (1971). Dynamic Probabilistic Systems. Vol II. Semi-Markov and Decision Processes Series in Decision and Control, New York: John Wiley & Sons.
16. Janssen, J. (1976). Some duality results in semi-Markov chain theory. Rev. Roum. Math. Pures Appl. 21:429-441.
17. Kapur, J. N. (1989). Maximum Entropy Models in Sciences and Engineering. New York: John Wiley.
18. Klimko, E. M., Sucheston, L. (1968). On convergence of information in spaces with infinite invariant measure. Z. Wahrsch. Verw. Geb. 10:226-235.
19. Krengel, U. (1967). Entropy of conservative transformations. Z. Wahrsch. verw. Geb. 7:161-181.
20. Kullback, S., Leibler, R. A. (1951). On information and sufficiency. Ann. Math. Stat. 29:79-86.
21. Limnios, N., Oprisan, G. (2001). Semi-Markov Processes and Reliability. Boston: Birkhauser.
22. Mcmillan, M. (1953). The basic theorems of information theory. Ann. Math. Stat. 24:196-219.
23. Perez, A. (1964). Extensions of Shannon-McMillan's limit theorem to more general stochastic processes. In: Trans. Third Prague Conf. Inf. Theory: Stat. Decision Functions and Random Processes. pp. 545-574.
24. Shannon, C. (1948). A mathematical theory of communication. Bell Syst., Techn. J. 27:379-423623-656.