Related papers: Ergodic Theorems for Lower Probabilities

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…

This paper is a survey of applications of the theory of algorithmic randomness to ergodic theory. We establish various degrees of constructivity for asymptotic laws of probability theory. In the framework of the Kolmogorov approach to the…

We formulate an ergodic theory for the (almost sure) limit $\mathcal{P}^\text{co}_{\tilde{\mathcal{E}}}$ of a sequence $(\mathcal{P}^\text{co}_{\mathcal{E}_n})$ of successive dynamic imprecise probability kinematics (DIPK, introduced in…

This is an earlier, but more general, version of "An L^1 Ergodic Theorem for Sparse Random Subsequences". We prove an L^1 ergodic theorem for averages defined by independent random selector variables, in a setting of general…

We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…

We give simple proofs, under minimal hypotheses, of the Weak Law of Large Numbers and the Central Limit Theorem for independent identically distributed random variables. These proofs use only the elementary calculus, together with the most…

We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…

We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…

The Oseledets Multiplicative Ergodic theorem is a basic result with numerous applications throughout dynamical systems. These notes provide an introduction to this theorem, as well as subsequent generalizations. They are based on lectures…

A result for subadditive ergodic cocycles is proved that provides more delicate information than Kingman's subadditive ergodic theorem. As an application we deduce a multiplicative ergodic theorem generalizing an earlier result of…

The law of likelihood underlies a general framework, known as the likelihood paradigm, for representing and interpreting statistical evidence. As stated, the law applies only to simple hypotheses, and there have been reservations about…

In this paper we obtain some possibilistic variants of the probabilistic laws of large numbers, different from those obtained by other authors, but very natural extensions of the corresponding ones in probability theory. Our results are…

We consider ergodic multiflows on a probability space. The general theorem on universal averaging for multiflows is applied to averaging along manifolds in $R^n$.

We introduce the notion of common conditional expectation to investigate Birkhoff's ergodic theorem and subadditive ergodic theorem for invariant upper probabilities. If in addition, the upper probability is ergodic, we construct an…

We utilize an ergodic theory framework to explore sublinear expectation theory. Specifically, we investigate the pointwise Birkhoff's ergodic theorem for invariant sublinear expectation systems. By further assuming that these sublinear…

We introduce methods that allow to derive continuous-time versions of various discrete-time ergodic theorems. We then illustrate these methods by giving simple proofs and refinements of some known results as well as establishing new results…

We consider a nonstationary random walk on a compact metrizable abelian group. Under a classical strict aperiodicity assumption we establish a weak-* convergence to the Haar measure, Ergodic Theorem and Large Deviation Type Estimate.

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

A very simple but useful almost sure convergence theorem of probability is given.

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…