Related papers: Ergodic theorem and algorithmic randomness

We study mean ergodicity in amenable operator semigroups and establish the connection to the convergence of strong and weak ergodic nets. We then use these results in order to show the convergence of uniform families of ergodic nets that…

The ergodic theorems of Hopf, Wiener and Birkhoff were extended to the context of Riesz spaces with a weak order unit and conditional expectation operator by Kuo, Labuschagne and Watson in [Ergodic Theory and the Strong Law of Large Numbers…

The Birkhoff Ergodic Theorem asserts under mild conditions that Birkhoff averages (i.e. time averages computed along a trajectory) converge to the space average. For sufficiently smooth systems, our small modification of numerical Birkhoff…

We calculate a certain mean-value of meromorphic functions by using specific ergodic transformations, which we call affine Boolean transformations. We use Birkhoff's ergodic theorem to transform the mean-value into a computable integral…

In this paper we give a direct proof of the equality of certain generating function associated with tensor product multiplicities of Kirillov-Reshetikhin modules for each simple Lie algebra g. Together with the theorems of Nakajima and…

We introduce a new notion of recursively generated enriched term which generalizes the one studied in joint work with Rosick\'y. These new terms come together with a notion of term-interpretability, which recovers the same type of…

We prove martingale-ergodic and ergodic-martingale theorems with continuous parameter for vector valued Bochner integrable functions. We first prove almost everywhere convergence of vector valued martingales with continuous parameter. The…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

In this manuscript, we consider finitely many maps, all of which are defined on a smooth compact measure space, with at least one map in the collection having degree strictly bigger than 1. Working with random dynamics generated by this…

Random substitutions are a natural generalisation of their classical `deterministic' counterpart, whereby at every step of iterating the substitution, instead of replacing a letter with a predetermined word, every letter is independently…

The Birkhoff Ergodic Theorem concludes that time averages, i.e., Birkhoff averages, $\Sigma_{n=0}^{N-1} f(x_n)/N$ of a function $f$ along a length $N$ ergodic trajectory $(x_n)$ of a function $T$ converge to the space average $\int f d\mu$,…

A simple model of the new notion of "Markov up" processes is proposed; its positive recurrence and ergodic properties are shown under the appropriate conditions.

We provide a mathematical theory and methodology for synthesising equational logics from algebraic metatheories. We illustrate our methodology by means of two applications: a rational reconstruction of Birkhoff's Equational Logic and a new…

Algorithmic statistics considers the following problem: given a binary string $x$ (e.g., some experimental data), find a "good" explanation of this data. It uses algorithmic information theory to define formally what is a good explanation.…

We introduce computable actions of computable groups and prove the following versions of effective Birkhoff's ergodic theorem. Let $\Gamma$ be a computable amenable group, then there always exists a canonically computable tempered two-sided…

In this paper we are concerned with the study of additive ergodic averages in multiplicative systems and the investigation of the "pretentious" dynamical behaviour of these systems. We prove a mean ergodic theorem (Theorem A) that…

In 2022, Bergelson and Richter established a new dynamical generalization of the prime number theorem. Later, Loyd showed a disjoint form with the Erd\H{o}s-Kac theorem. Recently, the author and his coauthors proved some ergodic theorems…

In this paper, among other things, we state and prove the mean ergodic theorem for amenable semigroup algebras.

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

In this paper we study ergodicity and mixing property of some measure preserving transformations on the Wiener space (W,H,\mu) which are generated by some random unitary operators defined on the Cameron-Martin space H.