Related papers: The Shannon-McMillan-Breiman theorem of random dyn…

An instability property of the Birkhoff's ergodic theorem and related asymptotic laws with respect to small violations of algorithmic randomness is studied. The Shannon--McMillan--Breiman theorem and all universal compression schemes are…

We introduce a new isomorphism-invariant notion of entropy for measure preserving actions of arbitrary countable groups on probability spaces, which we call orbital Rokhlin entropy. It employs Danilenko's orbital approach to entropy of a…

In the online prediction framework, we use generalized entropy of to study the loss rate of predictors when outcomes are drawn according to stationary ergodic distributions over the binary alphabet. We show that the notion of generalized…

We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shannon-McMillan-Breiman theorem in this setting. We also extend…

We formulate and prove a quantum Shannon-McMillan theorem. The theorem demonstrates the significance of the von Neumann entropy for translation invariant ergodic quantum spin systems on n-dimensional lattices: the entropy gives the…

An extension of the Shannon-McMillan-Breiman theorem to a class of non-commutative dynamical systems is given.

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

In this paper we generalize Kingman's sub-additive ergodic theorem to a large class of infinite countable discrete amenable group actions.

The idea of a parsing of a stationary process according to a collection of words is introduced, and the basic framework required for the asymptotic analysis of these parsings is presented. We demonstrate how the pointwise ergodic theorem…

The paper shows that, for large number of particles and for distinguishable and non-interacting identical particles, convergence to equiprobability of the $W$ microstates of the famous Boltzmann-Planck entropy formula $S=k \log(W)$ is…

In the current paper we attempt to transfer the notion of the projectional entropy, originally defined for multidimensional subshifts, to the case of actions of amenable groups. The main theorem states that if a system is strongly…

Let \mu be a computable ergodic shift-invariant measure over the Cantor space. Providing a constructive proof of Shannon-McMillan-Breiman theorem, V'yugin proved that if a sequence x is Martin-L\"of random w.r.t. \mu then the strong…

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 study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

We consider stationary ergodic processes indexed by $\mathbb Z$ or $\mathbb Z^n$ whose finite dimensional marginals have laws which are absolutely continuous with respect to Lebesgue measure. We define an entropy theory for these continuous…

The theorem of Shannon-McMillan-Breiman states that for every generating partition on an ergodic system, the exponential decay rate of the measure of cylinder sets equals the metric entropy almost everywhere (provided the entropy is…

We prove a weak form of the mean ergodic theorem for actions of amenable locally compact quantum groups in the von Neumann algebra setting.

Classical ergodic theory for integer-group actions uses entropy as a complete invariant for isomorphism of IID (independent, identically distributed) processes (a.k.a. product measures). This theory holds for amenable groups as well.…

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…

We prove a mean ergodic theorem for amenable discrete quantum groups. As an application, we prove a Wiener type theorem for continuous measures on compact metrizable groups.