Related papers: Using almost-everywhere theorems from analysis to …
In this paper we survey the almost sure central limit theorem and its functional form (quenched) for stationary and ergodic processes. For additive functionals of a stationary and ergodic Markov chain these theorems are known under the…
Algorithmic theories of randomness can be related to theories of probabilistic sequence prediction through the notion of a predictor, defined as a function which supplies lower bounds on initial-segment probabilities of infinite sequences.…
A concentration property of the functional ${-}\log f(X)$ is demonstrated, when a random vector X has a log-concave density f on $\mathbb{R}^n$. This concentration property implies in particular an extension of the Shannon-McMillan-Breiman…
Algorithmic learning theory traditionally studies the learnability of effective infinite binary sequences (reals), while recent work by [Vitanyi and Chater, 2017] and [Bienvenu et al., 2014] has adapted this framework to the study of…
In this short note we prove ``effective" geometric ergodicity (i.e a Perron-Frobenius theorem) for Markov chains in random mixing dynamical environment satisfying a random non-uniform version of the Doeblin condition. Effectivity here means…
This paper studies the problem of estimation from relative measurements in a graph, in which a vector indexed over the nodes has to be reconstructed from pairwise measurements of differences between its components associated to nodes…
This is a survey article with focus on the following problem. Given $f:X \to X$ a meromorphic endomorphism of some compact K\"ahler manifold $X$, construct and study - under natural numerical conditions - a canonical invariant probability…
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 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…
In this paper, we study arithmetic dynamics in arbitrary characteristic, in particular in positive characteristic. We generalise some basic facts on arithmetic degree and canonical height in positive characteristic. As applications, we…
We consider isometric actions of lattices in semisimple algebraic groups on (possibly non-compact) homogeneous spaces with (possibly infinite) invariant Radon measure. We assume that the action has a dense orbit, and demonstrate two novel…
We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…
Reinforcement learning (RL) problems are fundamental in online decision-making and have been instrumental in finding an optimal policy for Markov decision processes (MDPs). Function approximations are usually deployed to handle large or…
Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…
In the first part of this paper, we show that the small-ball condition, recently introduced by Mendelson (2015), may behave poorly for important classes of localized functions such as wavelets, piecewise polynomials or trigonometric…
We examine several notions of randomness for elements in a given $\Pi^0_1$ class $\mathcal{P}$. Such an effectively closed subset $\mathcal{P}$ of $2^\omega$ may be viewed as the set of infinite paths through the tree $T_{\mathcal{P}}$ of…
A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…
Let G be an algebraic group over a complete separable valued field k. We discuss the dynamics of the G-action on spaces of probability measures on algebraic G-varieties. We show that the stabilizers of measures are almost algebraic and the…
This paper is about the surprising interaction of a foundational result from model theory, about stability of theories, with algorithmic stability in learning. First, in response to gaps in existing learning models, we introduce a new…
The culmination of the papers (arXiv:0905.0518, arXiv:0910.0909) was a proof of the norm convergence in $L^2(\mu)$ of the quadratic nonconventional ergodic averages \frac{1}{N}\sum_{n=1}^N(f_1\circ T_1^{n^2})(f_2\circ…