International audienceWe provide a condition in terms of a supermartingale property for a functional of the Markov process, which implies (a) f-ergodicity of strong Markov processes at a subgeometric rate, and (b) a moderate deviation principle for an integral (bounded) functional. An equivalent condition in terms of a drift inequality on the extended generator is also given. Results related to (f,r)-regularity of the process, of some skeleton chains and of the resolvent chain are also derived. Applications to specific processes are considered, including elliptic stochastic differential equations, Langevin diffusions, hypoelliptic stochastic damping Hamiltonian systems and storage model

We present a new drift condition which implies rates of convergence to the stationary distribution of the iterates of a \psi-irreducible aperiodic and positive recurrent transition kernel. This condition, extending a condition introduced by Jarner and Roberts [Ann. Appl. Probab. 12 (2002) 224-247] for polynomial convergence rates, turns out to be very convenient to prove subgeometric rates of convergence. Several applications are presented including nonlinear autoregressive models, stochastic unit root models and multidimensional random walk Hastings-Metropolis algorithms

In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing. The algorithm consists in two steps: a local step, where each node in a network updates a local estimate using a stochastic approximation algorithm with decreasing step size, and a gossip step, where a node computes a local weighted average between its estimates and those of its neighbors. Convergence of the estimates toward a consensus is established under weak assumptions. The approach relies on two main ingredients: the existence of a Lyapunov function for the mean field in the agreement subspace, and a contraction property of the random matrices of weights in the subspace orthogonal to the agreement subspace. A second order analysis of the algorithm is also performed under the form of a Central Limit Theorem.The Polyak-averaged version of the algorithm is also considered.The authors are with LTCI -