Related papers: Ornstein Isomorphism and Algorithmic Randomness

Ornstein and Shields (Advances in Math., 10:143-146, 1973) proved that Brownian motion reflected on a bounded region is an infinite entropy Bernoulli flow and thus Ornstein theory yielded the existence of a measure-preserving isomorphism…

A consequence of Ornstein theory is that the infinite entropy flows associated with Poisson processes and continuous-time irreducible Markov chains on a finite number of states are isomorphic as measure-preserving systems. We give an…

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…

We consider the dynamical behavior of Martin-L\"of random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic…

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

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…

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…

In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…

In algorithmic randomness, when one wants to define a randomness notion with respect to some non-computable measure $\lambda $, a choice needs to be made. One approach is to allow randomness tests to access the measure $\lambda $ as an…

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…

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…

We prove the one-dimensional almost sure invariance principle with essentially optimal rates for slowly (polynomially) mixing deterministic dynamical systems, such as Pomeau-Manneville intermittent maps, with H\"older continuous…

We establish a Bernstein-type inequality for a class of stochastic processes that include the classical geometrically $\phi$-mixing processes, Rio's generalization of these processes, as well as many time-discrete dynamical systems. Modulo…

A Poisson system is a Poisson point process and a group action, together forming a measure-preserving dynamical system. Ornstein and Weiss proved Poisson systems over many amenable groups were isomorphic in their 1987 paper. We consider…

As part of a general theory for the isomorphism problem for actions of amenable groups, Ornstein and Weiss (J. Anal. Math. 48:1-141,1987) proved that any two Poisson point processes are isomorphic as measure-preserving actions. We give an…

We describe a Markov-Chain-Monte-Carlo algorithm which can be used to generate naturally labeled n-element posets at random with a probability distribution of one's choice. Implementing this algorithm for the uniform distribution, we…

We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, a point is typical for some dynamic, if it follows the…

Information theory on a time-discrete setting in the framework of time series analysis is generalized to the time-continuous case. Considerations of the Roessler and Lorenz dynamics as well as the Ornstein-Uhlenbeck process yield for…

Isotropic Brownian flows (IBFs) are a fairly natural class of stochastic flows which has been studied extensively by various authors. Their rich structure allows for explicit calculations in several situations and makes them a natural…

The Shannon entropy of a random variable has much behaviour analogous to a signed measure. Previous work has explored this connection by defining a signed measure on abstract sets, which are taken to represent the information that different…