Be they random or non-random, iterative methods have progressively gained sway with the
development of computer science and automatic control theory. Thus, being easy to …

The Nagaev-Guivarc'h method, via the perturbation operator theorem of Keller and Liverani,
has been exploited in recent papers to establish limit theorems for unbounded functionals of …

Let M be a noncompact metric space in which every closed ball is compact, and let G be a
semigroup of Lipschitz mappings of M. Denote by (Y n) n≥ 1 a sequence of independent G …

Let {$ X_n $} $ _ {n≥ 0} $ be a $ V $-geometrically ergodic Markov chain. Given some real-
valued functional $ F $, define $ M_n (α):= n^{− 1}∑ _ {k= 1}^ nF (α, X_ {k− 1}, X_k), α\in …

Théorème local pour chaînes de Markov de probabilité de transition quasi-compacte.
Applications aux chaînes V-géométrique Page 1 Ann. IH Poincaré – PR 41 (2005) 179–196 …

Let. Specifically, we propose a pattern of assumptions for studying such robustness
properties for an IFS. This pattern is implemented for the autoregressive processes with …

Abstract The Nagaev-Guivarc'h operator perturbation method is well known to provide
various probabilistic limit theorems for Markov random walks. A natural conjecture is that this …

Let $ P $ be a Markov kernel on a measurable space $\X $ and let $ V:\X\r [1,+\infty) $. We
provide various assumptions, based on drift conditions, under which $ P $ is quasi-compact …

Soit Q une probabilité de transition sur un espace mesurable E, admettant une probabilité
invariante, soit (X n) n une chaîne de Markov associée à Q, et soit ξ une fonction réelle …

We study the ergodic properties of Markov chains with an arbitrary state space and prove a
geometric ergodic theorem. The method of the proof is new: it may be described as an …