Related papers: Ergodic theorem and algorithmic randomness

We develop a Perron-Frobenius type theory for products of random quantum channels acting on finite-dimensional matrix algebras sampled from a stationary and ergodic stochastic process, which, in keeping with the literature, we call ergodic…

We present a proof of Roth's theorem that follows a slightly different structure to the usual proofs, in that there is not much iteration. Although our proof works using a type of density increment argument (which is typical of most proofs…

Using the notion of existentially closed structures, we obtain embedding theorems for groups and Lie algebras. We also prove the existence of some groups and Lie algebras with prescribed properties.

We revisit processes generated by iterated random functions driven by a stationary and ergodic sequence. Such a process is called strongly stable if a random initialization exists, for which the process is stationary and ergodic, and for…

The ergodic decomposition theorem is a cornerstone result of dynamical systems and ergodic theory. It states that every invariant measure on a dynamical system is a mixture of ergodic ones. Here we formulate and prove the theorem in terms…

We prove mean and pointwise ergodic theorems for the action of a discrete lattice subgroup in a connected algebraic Lie group, on infinite volume homogeneous algebraic varieties. Under suitable necessary conditions, our results are…

We describe an algorithm that, given a k-tuple of permutations representing the monodromy of a rational map, constructs an arbitrarily precise floating-point complex approximation of that map. We then explain how it has been used to study a…

We study ergodic properties of compositions of holomorphic endomorphisms of the complex projective space chosen independently at random according to some probability distribution. Along the way, we construct positive closed currents which…

This article shortly provides related proofs of the ergodic theorems of von Neumann, Birkhoff, Wiener, and Rokhlin's lemma for $Z^d$-actions with an invariant measure. It is shown how some deviations of ergodic averages can be structured.…

We prove a general result about the decomposition on ergodic components of group actions on boundaries of spherically homogeneous rooted trees. Namely, we identify the space of ergodic components with the boundary of the orbit tree…

In this paper we prove the correctness of Dijkstra's algorithm. We also discuss it and at the end we show an application.

We present an alternative proof of Perron's theorem, which is probabilistic in nature. It rests on the representation of the Perron eigenvector as a functional of the trajectory of an auxiliary Markov chain.

A remarkable theorem of Besicovitch is that an integrable function $f$ on $\mathbb{R}^2$ is strongly differentiable if and only if its associated strong maximal function $M_S f$ is finite a.e. We provide an analogue of Besicovitch's result…

The first algorithm for sampling the space of thick equilateral knots, as a function of thickness, will be described. This algorithm is based on previous algorithms of applying random reflections. To prove the existence of the algorithm, we…

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 present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…

We prove an equidistribution theorem a la Bader-Muchnik for operator-valued measures associated with boundary representations in the context of discrete groups of isometries of CAT(-1) spaces thanks to an equidistribution theorem of T.…

The Quantum Ergodic Conjecture equates the Wigner function for a typical eigenstate of a classically chaotic Hamiltonian with a delta-function on the energy shell. This ensures the evaluation of classical ergodic expectations of simple…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

The objective of this paper is to characterize the structure of the set $\Theta$ for a continuous ergodic upper probability $\mathbb{V}=\sup_{P\in\Theta}P$ (Theorem \ref {main result}): . $\Theta$ contains a finite number of ergodic…