Skip to Main content Skip to Navigation

Large Deviation Principle for Markov Chains in Discrete Time

Abstract : Let E be a denumerable state space, X be an homogeneous Markov chain on E with kernel P. Then the chain X verifies a weak Sanov's theorem, i.e. a weak large deviation principle holds for the law of the pair empirical measure. In our opinion this is an improvement with respect to the existing literature, insofar as the LDP in the Markov case often requires either the finiteness of E, or strong uniformity conditions, which important classes of chains do not verify (e.g. classical queueing networks with bounded jumps). Moreover this LDP holds for any discrete state space Markov chain, possibly non ergodic. The result is obtained by a new method, allowing to extend the LDP from a finite state space setting to a denumerable one, somehow like a the projective limit approach. The analysis presented here offers some by-products, among which an analogue of Varadhan's integral lemma and, under restrictive conditions, a contraction principle leading directly to a weak Sanov's theorem for the one--dimensional empirical measure.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 11:08:24 AM
Last modification on : Thursday, February 3, 2022 - 11:13:54 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:25:48 PM


  • HAL Id : inria-00072868, version 1



Arnaud de la Fortelle, Guy Fayolle. Large Deviation Principle for Markov Chains in Discrete Time. [Research Report] RR-3791, INRIA. 1999. ⟨inria-00072868⟩



Record views


Files downloads