Related papers: Ergodic theorems for algorithmically random points
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…
The Lovasz Local Lemma (LLL) is a powerful result in probability theory that states that the probability that none of a set of bad events happens is nonzero if the probability of each event is small compared to the number of events that…
This is a general description of a probabilistic formalism of mechanics, i.e., an extension of the Newtonian mechanics principles to the systems undergoing random motion. From an analysis of the induction procedure from experimental data to…
In the online prediction framework, we use generalized entropy of to study the loss rate of predictors when outcomes are drawn according to stationary ergodic distributions over the binary alphabet. We show that the notion of generalized…
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…
We prove mean and pointwise ergodic theorems for the action of a discrete lattice subgroup in a connected algebraic Lie group, on infinite volume homogeneous algebraic varieties. Under suitable necessary conditions, our results are…
The Shannon-McMillan-Breiman theorem is one of the most important results in information theory, which can describe the random ergodic process, and its proof uses the famous Birkhoff ergodic theorem, so it can be seen that it plays a…
This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical…
We provide a systematic, thorough treatment of the foundations of probability theory and stochastic processes along the lines of E. Bishop's constructive analysis. Every existence result presented shall be a construction; and the input…
Decision theories offer principled methods for making choices under various types of uncertainty. Algorithms that implement these theories have been successfully applied to a wide range of real-world problems, including materials and drug…
We construct universal prediction systems in the spirit of Popper's falsifiability and Kolmogorov complexity and randomness. These prediction systems do not depend on any statistical assumptions (but under the IID assumption they dominate,…
The Lov\'{a}sz Local Lemma (LLL) states that the probability that none of a set of "bad" events happens is nonzero if the probability of each event is small compared to the number of bad events it depends on. A series of results have…
The almost sure convergence of ergodic averages in Birkhoff's pointwise ergodic theorem is known to fail in the finitely additive setting. We introduce a natural reformulation of almost sure convergence suitable for finitely additive…
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…
Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of…
We prove a multiplicative ergodic theorem for bistochastic completely positive (bcp) linear cocycles acting on finite-dimensional matrix algebras, giving an invariant splitting described explicitly in terms of the multiplicative domains of…
We give a short combinatorial proof of the classical pointwise ergodic theorem for probability measure preserving $\mathbb{Z}$-actions. Our approach reduces the theorem to a tiling problem: tightly tile each orbit by intervals with desired…
We first develop a theory of conditional expectations for random variables with values in a complete metric space $M$ equipped with a contractive barycentric map $\beta$, and then give convergence theorems for martingales of…
In the framework of statistical mechanics the properties of macroscopic systems are deduced starting from the laws of their microscopic dynamics. One of the key assumptions in this procedure is the ergodic property, namely the equivalence…
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…