Related papers: Using almost-everywhere theorems from analysis to …
Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…
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…
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 initiate the study of effective pointwise ergodic theorems in resource-bounded settings. Classically, the convergence of the ergodic averages for integrable functions can be arbitrarily slow. In contrast, we show that for a class of…
This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…
A semi-measure is a generalization of a probability measure obtained by relaxing the additivity requirement to super-additivity. We introduce and study several randomness notions for left-c.e. semi-measures, a natural class of effectively…
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 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…
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…
Content of the lectures is the following. Properties of transformations equivalent to ergodicity. Birkhoff's Theorem. Properties equivalent to weak mixing. On typical properties of transformations. Lego to construct transformations. Typical…
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 develop a theory of multidimensional randomization in Lebesgue spaces $L^p$ with the aid of Kahane-Khintchine-Marcus-Pisier inequalities. More precisely, we obtain a result in the spirit of Maurey-Pisier's theorem which involves random…
We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…
We provide an ergodic theorem for certain Banach-space valued functions on structures over $\ZZ^d$, which allow for existence of frequencies of finite patterns. As an application we obtain existence of the integrated density of states for…
We study almost sure limiting behavior of extreme and intermediate order statistics arising from strictly stationary sequences. First, we provide sufficient dependence conditions under which these order statistics converges almost surely to…
We first survey the current state of the art concerning the dynamical properties of multidimensional continued fraction algorithms defined dynamically as piecewise fractional maps and compare them with algorithms based on lattice reduction.…
We prove various results on effective numberings and Friedberg numberings of families related to algorithmic randomness. The family of all Martin-L\"of random left-computably enumerable reals has a Friedberg numbering, as does the family of…
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 a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…