Related papers: Ergodic theorems for algorithmically random points
We give a generalization of the ergodic theorem for semi-Markov linear-type processes. This generalization is proved for the case when a common support of distributions defining this process is not arithmetic. Also we give an uniform…
This expository paper advocates an approach to physics in which ``typicality" is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and physics are reviewed. Their original versions…
The theoretical cornerstone of statistical mechanics is the ergodic assumption that all accessible configurations of a physical system are equally likely. Here we show how such property arises when an open quantum system is continuously…
A word-valued source $\mathbf{Y} = Y_1,Y_2,...$ is discrete random process that is formed by sequentially encoding the symbols of a random process $\mathbf{X} = X_1,X_2,...$ with codewords from a codebook $\mathscr{C}$. These processes…
We establish functional limit theorems for ergodic sums of observables with power singularities for expanding circle maps. In the regime where the observables have infinite variance, we show that when rescaled by $N^{1/s}(\ln N)^\alpha$,…
We formalise the self-referential definition of physical laws using monotone operators on a lattice of theories, resolving the pathologies of naive set-theoretic formulations. By invoking Tarski fixed point theorem, we identify physical…
Algorithms and dynamics over networks often involve randomization, and randomization may result in oscillating dynamics which fail to converge in a deterministic sense. In this paper, we observe this undesired feature in three applications,…
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…
Emergence of deterministic and irreversible macroscopic behavior from deterministic and reversible microscopic dynamics is understood as a result of the law of large numbers. In this paper, we prove on the basis of the theory of algorithmic…
This paper combines the decomposition technique ($\sigma$-stability) in random functional analysis with the deterministic theory of asymptotically pointwise contractions to provide a complete self-contained derivation of a fixed point…
Modern biomedical, behavioral and psychological inference about cause-effect relationships respects an ergodic assumption, that is, that mean response of representative samples allow predictions about individual members of those samples.…
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 form a sequence of oblong matrices by evaluating an integrable vector-valued function along the orbit of an ergodic dynamical system. We obtain an almost sure asymptotic result for the permanents of those matrices. We also give an…
We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…
We introduce the concepts of Baire Ergodicity and Ergodic Formalism, employing them to study topological and statistical attractors. Specifically, we establish the existence and finiteness of such attractors and provide applications for…
A method for obtaining simple criteria for instabilities in kinetic theory is described and outlined, specifically for the relativistic Vlasov-Maxwell system. An important ingredient of the method is an analysis of a parametrized set of…
We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if the sequence is a realization of a…
Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…
The well known Erdos-Turan law states that the logarithm of an order of a random permutation is asymptotically normally distributed. The aim of this work is to estimate convergence rate in this theorem and also to prove analogous result for…
We state a theorem relating the ergodicity of the action of a given subgroup of the mapping class group of a surface on the character variety, to the asymptotic of its invariant subspaces through the Witten-Reshetikhin-Turaev…