Related papers: Ergodicity of the zigzag process
We present a general framework for applying learning algorithms and heuristical guidance to the verification of Markov decision processes (MDPs). The primary goal of our techniques is to improve performance by avoiding an exhaustive…
In order to sample from a given target distribution (often of Gibbs type), the Monte Carlo Markov chain method consists in constructing an ergodic Markov process whose invariant measure is the target distribution. By sampling the Markov…
We provide sufficient conditions for the uniqueness of an invariant measure of a Markov process as well as for the weak convergence of transition probabilities to the invariant measure. Our conditions are formulated in terms of generalized…
Piecewise Deterministic Markov Processes (PDMPs) are studied in a general framework. First, different constructions are proven to be equivalent. Second, we introduce a coupling between two PDMPs following the same differential flow which…
We construct a general procedure for the Quasi Likelihood Analysis applied to a multivariate point process on the real half line in an ergodic framework. More precisely, we assume that the stochastic intensity of the underlying model…
As a useful and elegant tool of extreme value theory, the study of point processes on a metric space is important and necessary for the analyses of heavy-tailed functional data. This paper focuses on the definition and properties of such…
Martingale methods are used to study the almost everywhere convergence of general function series. Applications are given to ergodic series, which improves recent results of Fan \cite{FanETDS}, and to dilated series, including Davenport…
We give a short overview of recent results on a specific class of Markov process: the Piecewise Deterministic Markov Processes (PDMPs). We first recall the definition of these processes and give some general results. On more specific cases…
We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…
The particle Gibbs (PG) sampler is a systematic way of using a particle filter within Markov chain Monte Carlo (MCMC). This results in an off-the-shelf Markov kernel on the space of state trajectories, which can be used to simulate from the…
Juggler's exclusion process describes a system of particles on the positive integers where particles drift down to zero at unit speed. After a particle hits zero, it jumps into a randomly chosen unoccupied site. We model the system as a…
Monte Carlo simulations of systems of particles such as hard spheres or soft spheres with singular kernels can display around a phase transition prohibitively long convergence times when using traditional Hasting-Metropolis reversible…
For affine processes on finite-dimensional cones, we give criteria for geometric ergodicity - that is exponentially fast convergence to a unique stationary distribution. Ergodic results include both the existence of exponential moments of…
Recently, T. Tao gave a finitary proof a convergence theorem for multiple averages with several commuting transformations and soon later, T. Austin gave an ergodic proof of the same result. Although we give here one more proof of the same…
We consider piecewise deterministic Markov processes with degenerate transition kernels of the "house-of-cards"-type. We use a splitting scheme based on jump times to prove the absolute continuity, as well as some regularity, of the…
The ergodic decomposition theorem is a cornerstone result of dynamical systems and ergodic theory. It states that every invariant measure on a dynamical system is a mixture of ergodic ones. Here we formulate and prove the theorem in terms…
We exhibit an efficient procedure for testing, based on a single long state sequence, whether an unknown Markov chain is identical to or $\varepsilon$-far from a given reference chain. We obtain nearly matching (up to logarithmic factors)…
This paper investigates the ergodicity of stochastic functional differential equations with jumps under the Wasserstein distance by the generalized coupling method. Two key conditions are verified. The first is verified by establishing an…
In queuing theory and related problems, it is very important to know the numerical characteristics of an investigated system - both in stationary and non-stationary modes. In some cases, such characteristics can be calculated, but this is…
We present two limit theorems, a mean ergodic and a central limit theorem, for a specific class of one-dimensional diffusion processes that depend on a small-scale parameter $\varepsilon$ and converge weakly to a homogenized diffusion…