Related papers: Ergodic property of stable-like Markov chains

We give criteria for ergodicity, transience and null recurrence for the random walk in random environment on {0,1,2,...}, with reflection at the origin, where the random environment is subject to a vanishing perturbation. Our results…

We construct a Hunt process that can be described as an isotropic $\alpha$-stable L\'evy process reflected from the complement of a bounded open Lipschitz set. In fact, we introduce a new analytic method for concatenating Markov processes.…

A stable-like process is a Feller process $(X_t)_{t\geq 0}$ taking values in $\mathbb{R}^d$ and whose generator behaves, locally, like an $\alpha$-stable L\'evy process, but the index $\alpha$ and all other characteristics may depend on the…

We investigate the mixing properties of a model of reversible Markov chains in random environment, which notably contains the simple random walk on the superposition of a deterministic graph and a second graph whose vertex set has been…

A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the…

The first aim of this paper is to introduce a class of Markov chains on $\mathbb{Z}_+$ which are discrete self-similar in the sense that their semigroups satisfy an invariance property expressed in terms of a discrete random dilation…

We survey distributional properties of $\mathbb{R}^d$-valued cocycles of finite measure preserving ergodic transformations (or, equivalently, of stationary random walks in $\mathbb{R}^d$) which determine recurrence or transience.

For both continuous-time and discrete-time Markov Chains, we provide criteria for inverse problems of classical types of ergodicity: (ordinary) erogodicity, algebraic ergodicity, exponential ergodicity and strong ergodicity. Our criteria…

In this paper we discuss how the notion of subgeometric ergodicity in Markov chain theory can be exploited to study stationarity and ergodicity of nonlinear time series models. Subgeometric ergodicity means that the transition probability…

Stochastic reaction networks are mathematical models frequently used in, but not limited to, biochemistry. These models are continuous-time Markov chains whose transition rates depend on certain parameters called rate constants, which…

For discrete-time Markov chains on general state spaces, we establish criteria for non-ergodicity and non-strong ergodicity, and derive sufficient conditions for non-geometric ergodicity via the theory of minimal nonnegative solutions. Our…

We study the analogues of irreducibility, period, and communicating classes for open quantum random walks, as defined by Attal et al. (J. Stat. Phys., 2012). We recover results similar to the standard ones for Markov chains, in terms of…

Brownian yet non-Gaussian phenomenon has recently been observed in many biological and active matter systems. The main idea of explaining this phenomenon is to introduce a random diffusivity for particles moving in inhomogeneous…

We study a $d$-dimensional stochastic process $\mathbf{X}$ which arises from a L\'evy process $\mathbf{Y}$ by partial resetting, that is the position of the process $\mathbf{X}$ at a Poisson moment equals $c$ times its position right before…

We prove exponential decay of pair correlations for 1D stationary point processes when spacings satisfy a Markov condition, geometric ergodicity, and a condition on exponential moments. The conditions are phrased for stationary sequences of…

The central limit theorem for Markov chains generated by iterated function systems consisting of orientation preserving homeomorphisms of the interval is proved. We study also ergodicity of such systems.

For a reversible and ergodic Markov chain $\{X_n,n\geq0\}$ with invariant distribution $\pi$, we show that a valid confidence interval for $\pi(h)$ can be constructed whenever the asymptotic variance $\sigma^2_P(h)$ is finite and positive.…

Given access to a single long trajectory generated by an unknown irreducible Markov chain $M$, we simulate an $\alpha$-lazy version of $M$ which is ergodic. This enables us to generalize recent results on estimation and identity testing…

A common tool in the practice of Markov Chain Monte Carlo is to use approximating transition kernels to speed up computation when the desired kernel is slow to evaluate or intractable. A limited set of quantitative tools exist to assess the…