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

DOI10.1081/STA-120028687zbMath1114.60069MaRDI QIDQ3155281

Valérie Girardin, Nikolaos Limnios

Publication date: 14 January 2005

Published in: Communications in Statistics - Theory and Methods (Search for Journal in Brave)

Mathematics Subject Classification ID

Strong limit theorems (60F15) Markov renewal processes, semi-Markov processes (60K15)

Related Items

Entropy for semi-Markov processes with Borel state spaces: asymptotic equirepartition properties and invariance principles ⋮ Randomized Shortest-Path Problems: Two Related Models ⋮ A sum-over-paths extension of edit distances accounting for all sequence alignments ⋮ Rényi entropy rate for Gaussian processes

Cites Work

• Unnamed Item
• Unnamed Item
• Ergodic theory for discrete semi-Markov chains
• The Individual Ergodic Theorem of Information Theory
• Correction Notes: Correction to "The Individual Ergodic Theorem of Information Theory"
• Optimal simultaneous detection and estimation of filtered discrete semi-Markov chains
• On the entropy for semi-Markov processes
• On convergence of information in spaces with infinite invariant measure
• Entropy of conservative transformations
• A Note on the Ergodic Theorem of Information Theory
• Estimating the Infinitesimal Generator of a Continuous Time, Finite State Markov Process
• On Information and Sufficiency
• The Basic Theorems of Information Theory