Ergodicity of inhomogeneous Markov chains through asymptotic   pseudotrajectories
  In this work, we consider an inhomogeneous (discrete time) Markov chain and are interested in its long time behavior. We provide sufficient conditions to ensure that some of its asymptotic properties can be related to the ones of a homogeneous (continuous time) Markov process. Renowned examples such as a bandit algorithms, weighted random walks or decreasing step Euler schemes are included in our framework. Our results are related to functional limit theorems, but the approach differs from the standard "Tightness/Identification" argument; our method is unified and based on the notion of pseudotrajectories on the space of probability measures. 
Michel Bena\"im (UNINE), Florian Bouguet (Inria, IECL), Bertrand Cloez   (MISTEA)
math.PR