Related papers: Ergodic Theorems for discrete Markov chains

We prove pointwise convergence, as $N\to \infty$, for the multiple ergodic averages $\frac{1}{N}\sum_{n=1}^N f(T^nx)\cdot g(S^{a_n}x)$, where $T$ and $S$ are commuting measure preserving transformations, and $a_n$ is a random version of the…

We investigate the spectrum of the infinitesimal generator of the continuous time random walk on a randomly weighted oriented graph. This is the non-Hermitian random nxn matrix L defined by L(j,k)=X(j,k) if k<>j and…

This brief pedagogical note re-proves a simple theorem on the convergence, in $L_2$ and in probability, of time averages of non-stationary time series to the mean of expectation values. The basic condition is that the sum of covariances…

We prove that for a random walk on the real line whose increments have zero mean and are either integer-valued or spread out (i.e. the distributions of the steps of the walk are eventually non-singular), the Markov chain of overshoots above…

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)…

We introduce the concept of asymptotic period for an irreducible and aperiodic, discrete-time Markov chain X on a countable state space, and develop the theory leading to its formal definition. The asymptotic period of X equals one - its…

Recursive stochastic algorithms have gained significant attention in the recent past due to data driven applications. Examples include stochastic gradient descent for solving large-scale optimization problems and empirical dynamic…

For an ergodic action of the group $Z^n$ on a probability space and a given arbitrarily slowly decreasing to zero sequence, there exists an integrable function such that the standard ergodic time averages for it converge almost everywhere…

We consider whether ergodic Markov chains with bounded step size remain bounded in probability when their transitions are modified by an adversary on a bounded subset. We provide counterexamples to show that the answer is no in general, and…

Assume that one observes the $k$th, $2k$th$,\ldots,nk$th value of a Markov chain $X_{1,h},\ldots,X_{nk,h}$. That means we assume that a high frequency Markov chain runs in the background on a very fine time grid but that it is only observed…

A sequence $(s_n)$ of integers is good for the mean ergodic theorem if for each invertible measure preserving system $(X,\mathcal{B},\mu,T)$ and any bounded measurable function $f$, the averages $ \frac1N \sum_{n=1}^N f(T^{s_n}x)$ converge…

We present an algorithm that can efficiently compute a broad class of inferences for discrete-time imprecise Markov chains, a generalised type of Markov chains that allows one to take into account partially specified probabilities and other…

For a Markov chain $Y$ with values in a Polish space, consider the entrance Markov chain obtained by sampling $Y$ at the moments when it enters a fixed set $A$ from its complement $A^c$. Similarly, consider the exit Markov chain, obtained…

Let $\Psi_n$ be a product of $n$ independent, identically distributed random matrices $M$, with the properties that $\Psi_n$ is bounded in $n$, and that $M$ has a deterministic (constant) invariant vector. Assuming that the probability of…

Nonlinear Markov chains with finite state space have been introduced in Kolokoltsov (2010). The characteristic property of these processes is that the transition probabilities do not only depend on the state, but also on the distribution of…

We study perturbation theory and uniform ergodicity for discrete-time Markov chains on general state spaces in terms of the uniform moments of the first hitting times on some set. The methods we adopt are different from previous ones. For…

We determine the probability distribution for relative projective objects in an exceptional sequence of type $A_n$ of any length. We show that these events (the $j$-th object in an exceptional sequence of length $k\le n$ being relatively…

Let $X$ be the constrained random walk on $\mathbb{Z}_+^d$ $d >2$, having increments $e_1$, $-e_i+e_{i+1}$ $i=1,2,3,...,d-1$ and $-e_d$ with probabilities $\lambda$, $\mu_1$, $\mu_2$,...,$\mu_d$, where $\{e_1,e_2,..,e_d\}$ are the standard…

Let $\mathbf X=(X_{jk})$ denote a $n\times p$ random matrix with entries $X_{jk}$, which are independent for $1\le j\le n, 1\le k\le p$. Let $n,p$ tend to infinity such that $\frac np=y+O(n^{-1})\in(0,1]$. For those values of $n,p$ we…

This paper proposes a new type of recurrence where we divide the Markov chains into intervals that start when the chain enters into a subset A, then sample another subset B far away from A and end when the chain again return to A. The…