February 27, 2022
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 substantiation of the probability theory and information theory on the base of the theory of algorithms, we formulate probabilistic laws, i.e. statements which hold almost surely, in a pointwise form, i.e., for Martin-Lof random points. It i...
October 31, 2011
These notes are a self-contained introduction to the use of dynamical and probabilistic methods in the study of hyperbolic groups. Most of this material is standard; however some of the proofs given are new, and some results are proved in greater generality than have appeared in the literature. These notes originated in a minicourse given at a workshop in Melbourne, July 11-15 2011.
July 27, 2017
Let $X_n$ be a discrete time Markov chain with state space $S$ (countably infinite, in general) and initial probability distribution $\mu^{(0)} = (P(X_0=i_1),P(X_0=i_2),\cdots,)$. What is the probability of choosing in random some $k \in \mathbb{N}$ with $k \leq n$ such that $X_k = j$ where $j \in S$? This probability is the average $\frac{1}{n} \sum_{k=1}^n \mu^{(k)}_j$ where $\mu^{(k)}_j = P(X_k = j)$. In this note we will study the limit of this average without assuming th...
July 15, 2022
In this paper, we examine the Renyi entropy rate of stationary ergodic processes. For a special class of stationary ergodic processes, we prove that the Renyi entropy rate always exists and can be polynomially approximated by its defining sequence; moreover, using the Markov approximation method, we show that the Renyi entropy rate can be exponentially approximated by that of the Markov approximating sequence, as the Markov order goes to infinity. For the general case, by con...
January 9, 2012
The goal of this notice is to establish Not-commutative Point- wise Ergodic Theorems for actions of the Hyperbolic Groups. Similar non-commutative results were done by Bufetov, Khristoforov and Kli- menko, and later by Pollicott and Sharp. We were interested to expand short notice in Policott and Sharp's paper about non-commutative er- godic theorems.
August 10, 2020
We establish a generalization of Bourgain double recurrence theorem by proving that for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, and for any non-constant polynomials $P, Q$ mapping natural numbers to themselves, for any $f,g \in L^2(X)$, and for almost all $x \in X$, we have $$\lim_{\bar{N} \longrightarrow +\infty} \frac{1}{N} \sum_{n=1}^{N}\boldsymbol{\nu}(n) f(T^{P(n)}x)g(T^{Q(n)}x)=0$$ where $\boldsymbol{\nu}$ is the Liouville function or the M\"{o}...
July 16, 2021
We prove strengthenings of the Birkhoff Ergodic Theorem for weakly mixing and strongly mixing measure preserving systems. We show that our pointwise theorem for weakly mixing systems is strictly stronger than the Wiener-Wintner Theorem. We also show that our pointwise Theorems for weakly mixing and strongly mixing systems characterize weakly mixing systems and strongly mixing systems respectively. The methods of this paper also allow one to prove an enhanced pointwise ergodic...
December 6, 2010
We prove pointwise convergence, as $N\to \infty$, for the multiple ergodic averages $\frac{1}{N}\sum_{n=1}^N f(T^nx)\cdot g(S^{a_n}x)$, where $T$ and $S$ are commuting measure preserving transformations, and $a_n$ is a random version of the sequence $[n^c]$ for some appropriate $c>1$. We also prove similar mean convergence results for averages of the form $\frac{1}{N}\sum_{n=1}^N f(T^{a_n}x)\cdot g(S^{a_n}x)$, as well as pointwise results when $T$ and $S$ are powers of the sa...
March 17, 2008
This survey is a 2022 update of the 2008 version, with recent developments and new references.
December 9, 2020
We establish a generalization of Bourgain double recurrence theorem and ergodic Bourgain-Sarnak's theorem by proving that for any aperiodic $1$-bounded multiplicative function $\boldsymbol{\nu}$, for any map $T$ acting on a probability space $(X,\mathcal{A},\mu)$, for any integers $a,b$, for any $f,g \in L^2(X)$, and for almost all $x \in X$, we have \[\frac{1}{N} \sum_{n=1}^{N} \boldsymbol{\nu}(n) f(T^{a n}x)g(T^{bn}x) \xrightarrow[N\rightarrow +\infty]{} 0.\] We further pre...