Related papers: Randomness and Non-ergodic Systems
Ergodic systems, being indecomposable are important part of the study of dynamical systems but if a system is not ergodic, it is natural to ask the following question: Is it possible to split it into ergodic systems in such a way that the…
We give examples of rank-one transformations that are (weak) doubly ergodic and rigid (so all their cartesian products are conservative), but with non-ergodic $2$-fold cartesian product. We give conditions for rank-one infinite…
In this paper, we investigate capacity preserving transformations and their ergodicity. We show that for any measurable transformation $\theta$ there always exists a $\theta$-invariant capacity. We investigate some limit properties under…
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 $…
The paper considers quantitative versions of different randomness notions: algorithmic test measures the amount of non-randomness (and is infinite for non-random sequences). We start with computable measures on Cantor space (and Martin-Lof…
In 1970, Donald Ornstein proved a landmark result in dynamical systems, viz., two Bernoulli systems with the same entropy are isomorphic except for a measure 0 set. Keane and Smorodinsky gave a finitary proof of this result. They also…
We establish an uncountable amenable ergodic Roth theorem, in which the acting group is not assumed to be countable and the space need not be separable. This generalizes a previous result of Bergelson, McCutcheon and Zhang, and complements…
We study Doob's martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given.…
Karlsson and Margulis proved in the setting of uniformly convex geodesic spaces, which additionally satisfy a nonpositive curvature condition, an ergodic theorem that focuses on the asymptotic behavior of integrable cocycles of nonexpansive…
An outlier is a datapoint that is set apart from a sample population. The outlier theorem in algorithmic information theory states that given a computable sampling method, outliers must appear. We present a simple proof to the outlier…
We introduce the notion of common conditional expectation to investigate Birkhoff's ergodic theorem and subadditive ergodic theorem for invariant upper probabilities. If in addition, the upper probability is ergodic, we construct an…
We examine some of the properties of uniformly rigid transformations, and analyze the compatibility of uniform rigidity and (measurable) weak mixing along with some of their asymptotic convergence properties. We show that on Cantor space,…
Studying Birkhoff sums of non-integrable functions involves the challenge of large observations depending on the sampled orbit, which prevents pointwise limit theorems. To address this issue, the largest observations are removed, this…
We give computable bounds on the rate of convergence of the transition probabilities to the stationary distribution for a certain class of geometrically ergodic Markov chains. Our results are different from earlier estimates of Meyn and…
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.…
Any discrete quantum process is represented by a sequence of quantum channels. We consider ergodic quantum processes obtained by a map that takes the points along the trajectory of a discrete ergodic dynamical system to the space of quantum…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
We study two properties of nonsingular and infinite measure-preserving ergodic systems: weak double ergodicity, and ergodicity with isometric coefficients. We show that there exist infinite measure-preserving transformations that are…
Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…
In the framework of statistical mechanics the properties of macroscopic systems are deduced starting from the laws of their microscopic dynamics. One of the key assumptions in this procedure is the ergodic property, namely the equivalence…