Related papers: On some Limit Theorem for Markov Chain

In this paper we give sufficient conditions for the almost sure central limit theorem started at a point, known under the name of quenched central limit theorem. This is achieved by using a new idea of conditioning with respect to both the…

A central limit theorem is proved for some strictly stationary sequences of random variables that satisfy certain mixing conditions and are subjected to the "shrinking operators" $U_r(x):=[\max\{|x|-r,0\}]\cdot x/|x|,\ r \ge 0$. For…

Consider a filtering process associated to a hidden Markov model with densities for which both the state space and the observation space are complete, separable, metric spaces. If the underlying, hidden Markov chain is strongly ergodic and…

We prove a central limit theorem for a class of additive processes that arise naturally in the theory of finite horizon Markov decision problems. The main theorem generalizes a classic result of Dobrushin (1956) for temporally…

Let $(\xi_n)_{n=0}^\infty$ be a nonhomogeneous Markov chain taking values from finite state-space of $\mathbf{X}=\{1,2,\ldots,b\}$. In this paper, we will study the generalized entropy ergodic theorem with almost-everywhere and…

We study the free central limit theorem for not necessarily identically distributed free random variables where the limiting distribution is the semicircle distribution. Starting from an estimate for the Kolmogorov distance between the…

The purpose of this work is to establish a central limit theorem that can be applied to a particular form of Markov chains, including the number of descents in a random permutation of $\mathfrak{S}_n$, two-type generalized P{\'o}lya urns,…

The distribution of a Markov process with killing, conditioned to be still alive at a given time, can be approximated by a Fleming-Viot type particle system. In such a system, each particle is simulated independently according to the law of…

We study the limiting object of a sequence of Markov chains analogous to the limits of graphs, hypergraphs, and other objects which have been studied. Following a suggestion of Aldous, we assign to a sequence of finite Markov chains with…

Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…

The first aim of this paper is to wonder to what extent we can generalize the central limit theorem of Gordin [5] under the so-called L 1-projective criteria to ergodic stationary random fields when completely commuting filtrations are…

M-dependence is a commonly used assumption in the study of dependent sequences. In this paper, central limit theorems for m-dependent random variables under the sub-linear expectations are established based mainly on the conditions of…

In this paper, we give the central limit theorem and almost sure central limit theorem for products of some partial sums of independent identically distributed random variables.

In this paper, we establish a spatial central limit theorem for a large class of supercritical branching, not necessarily symmetric, Markov processes with spatially dependent branching mechanisms satisfying a second moment condition. This…

In this paper, we prove a central limit theorem for a sequence of iterated Shorohod integrals using the techniques of Malliavin calculus. The convergence is stable, and the limit is a conditionally Gaussian random variable. Some…

Suppose that X_n, n>=0 is a stationary Markov chain and V is a certain function on a phase space of the chain, called an observanle. We say that the observable satisfies the central limit theorem (C.L.T.) if Y_n:=N^{-1/2}\sum_{n=0}^NV(X_n)…

A Central Limit Theorem is proved for linear random fields when sums are taken over finite disjoint union of rectangles. The approach does not rely upon the use of Beveridge Nelson decomposition and the conditions needed are similar to…

In this paper we prove a sharp quantitative version of the Kendall's Theorem. The Kendal Theorem states that under some mild conditions imposed on a probability distribution on positive integers (i.e. probabilistic sequence) one can prove…

The dynamics of one parameter diagonal group actions on finite volume homogeneous spaces has a partially hyperbolic feature. In this paper we extend the Liv\v{s}ic type result to these possibly noncompact and nonaccessible systems. We also…

We study the ergodic behaviour of a discrete-time process $X$ which is a Markov chain in a stationary random environment. The laws of $X_t$ are shown to converge to a limiting law in (weighted) total variation distance as $t\to\infty$.…