Related papers: Ergodic theorems for algorithmically random points

We prove the constructive version of Birkhoff's ergodic theorem following Vyugin but trying to separate and state explicitly the combinatorial statement on which this proof is based. We pose some questions related to this statement (and the…

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 characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…

An instability property of the Birkhoff's ergodic theorem and related asymptotic laws with respect to small violations of algorithmic randomness is studied. The Shannon--McMillan--Breiman theorem and all universal compression schemes are…

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

We establish an Ergodic Theorem for lower probabilities, a generalization of standard probabilities widely used in applications. As a by-product, we provide a version for lower probabilities of the Strong Law of Large Numbers.

A theorem of Ku\v{c}era states that given a Martin-L\"of random infinite binary sequence {\omega} and an effectively open set A of measure less than 1, some tail of {\omega} is not in A. We first prove several results in the same spirit and…

We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…

Hopf's ratio ergodic theorem has an inherent symmetry which we exploit to provide a simplification of standard proofs of Hopf's and Birkhoff's ergodic theorems. We also present a ratio ergodic theorem for conservative transformations on a…

We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

Let $\mathcal{P}$ be an (unbounded) countable multiset of primes, let $G=\bigoplus_{p\in P}\mathbb{F}_p$. We study the $k$'th universal characteristic factors of an ergodic probability system $(X,\mathcal{B},\mu)$ with respect to some…

We prove pointwise and maximal ergodic theorems for probability measure preserving (p.m.p.) actions of any countable group, provided it admits an essentially free, weakly mixing amenable action of stable type $III_1$. We show that this…

In 2022, Bergelson and Richter gave a new dynamical generalization of the prime number theorem by establishing an ergodic theorem along the number of prime factors of integers. They also showed that this generalization holds as well if the…

We propose a generalization of the Poincar\'e-Birkhoff Theorem on area-preserving twist maps to area-preserving twist maps that are random with respect to an ergodic probability measure. The classical theory is a particular instance of the…

It is known that a gambler repeating a game with positive expected value has a positive probability to never go broke. We use the mass transport method to prove the generalization of this fact where the gains from the bets form a…

We consider the dynamical behavior of Martin-L\"of random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic…

The classical Birkhoff ergodic theorem states that for an ergodic Markov process the limiting behaviour of the time average of a function (having finite $p$-th moment, $p\ge1$, with respect to the invariant measure) along the trajectories…

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…

We make the first steps towards an understanding of the ergodic properties of a rational map defined over a complete algebraically closed non-archimedean field. For such a rational map R, we construct a natural invariant probability measure…

We apply recent ideas about complexity and randomness to the philosophy of laws and chances. We develop two ways to use algorithmic randomness to characterize probabilistic laws of nature. The first, a generative chance* law, employs a…