Related papers: Ergodic theorems for algorithmically random points

In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…

We prove a ratio ergodic theorem for non-singular free $Z^d$ and $R^d$ actions, along balls in an arbitrary norm. Using a Chacon-Ornstein type lemma the proof is reduced to a statement about the amount of mass of a probability measure that…

We introduce a theory of probability in $\lambda$-rings designed to efficiently describe random variables valued in multisets of complex numbers, varieties over a field, or other similar enriched settings. A key role is played by the…

We study ergodic properties of some Markov chains models in random environments when the random Markov kernels that define the dynamic satisfy some usual drift and small set conditions but with random coefficients. In particular, we adapt a…

The stochastic theory of relativistic quantum mechanics presented here is modelled on the one that has been proposed previously and that was claimed to be a promising substitute to the orthodox theory in the non-relativistic domain. So it…

In this manuscript, we consider finitely many maps, all of which are defined on a smooth compact measure space, with at least one map in the collection having degree strictly bigger than 1. Working with random dynamics generated by this…

Consider a probability measure supported by a regular geodesic ball in a manifold. For any p larger than or equal to 1 we define a stochastic algorithm which converges almost surely to the p-mean of the measure. Assuming furthermore that…

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…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

From a dynamical viewpoint, basic phase transitions of statistical mechanics can be regarded as a breaking of ergodicity. While many random models exhibiting such transitions at the thermodynamics limit exist, finite-dimensional examples…

We consider a robust asymptotic growth problem under model uncertainty in the presence of stochastic factors. We fix two inputs representing the instantaneous covariance for the asset price process $X$, which depends on an additional…

We prove a multidimensional ergodic theorem with weighted averages for the action of the group $\mathbb{Z}^d$ on a probability space. At level $n$ weights are of the form $n^{-d} \psi(j/n)$, $ j\in \mathbb{Z}^d$, for real functions $\psi$…

We study the long-time behavior of an additive functional that takes into account the jumps of a symmetric Markov process. This process is assumed to be observed through a biased observation scheme that includes the survival to events of…

We construct multiperiodic processes -- a simple example of stationary ergodic (but not mixing) processes over natural numbers that enjoy the vanishing entropy rate under a mild condition. Multiperiodic processes are supported on randomly…

The paper is a sketch of systematic presentation of distributional limit theorems and their refinements for compound sums. When analyzing, e.g., ergodic semi-Markov systems with discrete or continuous time, this allows us to separate those…

We prove maximal inequalities for concentric ball and spherical shell averages on a general Gromov hyperbolic group, in arbitrary probability preserving actions of the group. Under an additional condition, satisfied for example by all…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

Here we present an ergodic theorem which adapts a Theorem by J. Elton to the classical thermodynamical formalism and to ergodic transport. First, we discuss how Elton's theorem can be used to characterise Gibbs measures for expanding maps.…

We calculate a certain mean-value of meromorphic functions by using specific ergodic transformations, which we call affine Boolean transformations. We use Birkhoff's ergodic theorem to transform the mean-value into a computable integral…

The mathematical definitions of distinct concepts that are needed in building an ergodicity detection algorithm are introduced in a framework. This algorithmic framework is expressed in a discrete setting in an accessible manner for broader…