English
Related papers

Related papers: Ergodic Theorems for discrete Markov chains

200 papers

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

Probability · Mathematics 2016-09-07 Cheng-Der Fuh

Let $\{X_n\}$ be a stationary and ergodic time series taking values from a finite or countably infinite set ${\cal X}$. Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times $\lambda_n$…

Probability · Mathematics 2008-06-19 G. Morvai , B. Weiss

Let $(X_n)_{n \in\mathbb{N}}$ be a $V$-geometrically ergodic Markov chain on a measurable space $\mathbb{X}$ with invariant probability distribution $\pi$. In this paper, we propose a discretization scheme providing a computable sequence…

Probability · Mathematics 2019-10-09 Loic Hervé , James Ledoux

Consider a Markov chain $\{X_n\}_{n\ge 0}$ with an ergodic probability measure $\pi$. Let $\Psi$ a function on the state space of the chain, with $\alpha$-tails with respect to $\pi$, $\alpha\in (0,2)$. We find sufficient conditions on the…

Probability · Mathematics 2009-12-15 Milton Jara , Tomasz Komorowski , Stefano Olla

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$.…

Probability · Mathematics 2019-07-29 Balazs Gerencser , Miklos Rasonyi

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…

Quantum Algebra · Mathematics 2021-10-22 J. P. McCarthy

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…

Probability · Mathematics 2015-01-19 Zhongzhi Wang , Weiguo Yang

The purpose of this paper is to study the time average behavior of Markov chains with transition probabilities being kernels of completely continuous operators, and therefore to provide a sufficient condition for a class of Markov chains…

Probability · Mathematics 2018-11-16 Shizhou Xu

Let $(\Omega,\mathcal{F}, \mathbb{P})$ be a probability space and $E$ be a finite set. Assume that $X=(X_n)$ is an irreducible and aperiodic Markov chain, defined on $(\Omega,\mathcal{F}, \mathbb{P})$, with values in $E$ and with transition…

Probability · Mathematics 2017-12-05 Yinna Ye

This paper develops an optimal Chernoff type bound for the probabilities of large deviations of sums $\sum_{k=1}^n f (X_k)$ where $f$ is a real-valued function and $(X_k)_{k \in \mathbb{Z}_{\ge 0}}$ is a finite state Markov chain with an…

Probability · Mathematics 2019-12-24 Vrettos Moulos , Venkat Anantharam

In a Markov chain started at a state $x$, the hitting time $\tau(y)$ is the first time that the chain reaches another state $y$. We study the probability $\mathbf{P}_x(\tau(y) = t)$ that the first visit to $y$ occurs precisely at a given…

Probability · Mathematics 2014-08-06 James Norris , Yuval Peres , Alex Zhai

For an ergodic Markov chain $\{X(t)\}$ on $\Bbb N$, with a stationary distribution $\pi$, let $T_n>0$ denote a hitting time for $[n]^c$, and let $X_n=X(T_n)$. Around 2005 Guy Louchard popularized a conjecture that, for $n\to \infty$, $T_n$…

Combinatorics · Mathematics 2010-05-13 Boris Pittel

The problem of estimating an unknown discrete distribution from its samples is a fundamental tenet of statistical learning. Over the past decade, it attracted significant research effort and has been solved for a variety of divergence…

Machine Learning · Computer Science 2018-10-30 Yi Hao , Alon Orlitsky , Venkatadheeraj Pichapati

We consider a Markov chain X_1, X_2, ..., X_n belonging to a class of iterated random functions, which is "one-step contracting" with respect to some distance d. If f is any separately Lipschitz function with respect to d, we use a well…

Probability · Mathematics 2014-02-18 Jérôme Dedecker , Xiequan Fan

General characterizations of ergodic Markov chains have been developed in considerable detail. In this paper, we study the transience for discrete-time Markov chains on general state spaces, including the geometric transience and algebraic…

Probability · Mathematics 2013-01-08 Yong-Hua Mao , Yan-Hong Song

We prove the first Chernoff-Hoeffding bounds for general nonreversible finite-state Markov chains based on the standard L_1 (variation distance) mixing-time of the chain. Specifically, consider an ergodic Markov chain M and a weight…

Probability · Mathematics 2012-01-31 Kai-Min Chung , Henry Lam , Zhenming Liu , Michael Mitzenmacher

A piecewise-deterministic Markov process, specified by random jumps and switching semi-flows, as well as the associated Markov chain given by its post-jump locations, are investigated in this paper. The existence of an exponentially…

Probability · Mathematics 2020-12-07 Dawid Czapla , Katarzyna Horbacz , Hanna Wojewódka-Ściążko

We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…

Probability · Mathematics 2007-05-23 Peter H. Baxendale

Given an ergodic finite-state Markov chain, let M_{iw} denote the mean time from i to equilibrium, meaning the expected time, starting from i, to arrive at a state selected randomly according to the equilibrium measure w of the chain. John…

Probability · Mathematics 2009-09-16 Peter G. Doyle

Let $(X_n \colon n\in\Z)$ be a two-sided recurrent Markov chain with fixed initial state $X_0$ and let $\nu$ be a probability measure on its state space. We give a necessary and sufficient criterion for the existence of a non-randomized…

Probability · Mathematics 2015-06-11 Peter Morters , Istvan Redl
‹ Prev 1 2 3 10 Next ›