Relative entropy and waiting times for continuous-time markov processes

3Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

For discrete-time stochastic processes, there is a close connection between return (resp. waiting) times and entropy (resp. relative entropy). Such a connection cannot be straightforwardly extended to the continuous-time setting. Contrarily to the discrete-time case one needs a reference measure on path space and so the natural object is relative entropy rather than entropy. In this paper we elaborate on this in the case of continuous-time Markov processes with finite state space. A reference measure of special interest is the one associated to the time-reversed process. In that case relative entropy is interpreted as the entropy production rate. The main results of this paper are: almost-sure convergence to relative entropy of the logarithm of waiting-times ratios suitably normalized, and their fluctuation properties (central limit theorem and large deviation principle). © 2006 Applied Probability Trust.

Cite

CITATION STYLE

APA

Chazottes, J. R., Giardina, C., & Redig, F. (2006). Relative entropy and waiting times for continuous-time markov processes. Electronic Journal of Probability, 11, 1049–1068. https://doi.org/10.1214/EJP.v11-374

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free