Related papers: Randomness and Non-ergodic Systems

It is notoriously difficult to apply statistical mechanics to generally covariant systems, because the notions of time, energy and equilibrium are seriously modified in this context. We discuss the conditions under which weaker versions of…

We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…

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…

A random-walk Metropolis sampler is geometrically ergodic if its equilibrium density is super-exponentially light and satisfies a curvature condition [Stochastic Process. Appl. 85 (2000) 341-361]. Many applications, including Bayesian…

We study the semiclassical behaviour of eigenfunctions of quantum systems with ergodic classical limit. By the quantum ergodicity theorem almost all of these eigenfunctions become equidistributed in a weak sense. We give a simple derivation…

We study the computational content of the Radon-Nokodym theorem from measure theory in the framework of the representation approach to computable analysis. We define computable measurable spaces and canonical representations of the measures…

For linear random dynamical systems in a separable Banach space $X$, we derived a series of Krein-Rutman type Theorems with respect to co-invariant cone family with rank-$k$, which present a (quasi)-equivalence relation between the…

Random matrices tend to be well conditioned, and we employ this well known property to advance matrix computations. We prove that our algorithms employing Gaussian random matrices are efficient, but in our tests the algorithms have…

The classical Birkhoff ergodic theorem in its most popular version says that the time average along a single typical trajectory of a dynamical system is equal to the space average with respect to the ergodic invariant distribution. This…

We prove a pointwise ergodic theorem and a maximal inequality for actions of amenable groups on noncommutative measure spaces. To do so, we establish a square function estimate quantifying the difference between ergodic averages and some…

The aim of this paper is to prove ergodic decomposition theorems for probability measures quasi-invariant under Borel actions of inductively compact groups (Theorem 1) as well as for sigma-finite invariant measures (Corollary 1). For…

We derive computationally tractable methods to select a small subset of experiment settings from a large pool of given design points. The primary focus is on linear regression models, while the technique extends to generalized linear models…

We study conservative particle systems on W^S, where S is countable and W = {0, ..., N} or the natural numbers. The rate of a particle moving from site x to site y is given by p(x,y) b(eta_x, eta_y), where eta_z is the number of particles…

We study the interaction between polynomial space randomness and a fundamental result of analysis, the Lebesgue differentiation theorem. We generalize Ko's framework for polynomial space computability in $\mathbb{R}^n$ to define…

We discuss an invertible version of Furstenberg's `Ergodic CP Shift Systems'. We show that the explicit regularity of these dynamical systems with respect to magnification of measures, implies certain regularity with respect to translation…

For general quantum systems the semiclassical behaviour of eigenfunctions in relation to the ergodic properties of the underlying classical system is quite difficult to understand. The Wignerfunctions of eigenstates converge weakly to…

Experiments in Rydberg atoms have recently found unusually slow decay from a small number of special initial states. We investigate the robustness of such long-lived states (LLS) by studying an ensemble of locally constrained random systems…

This paper is a comment on the paper "Quantum Mechanics and Algorithmic Randomness" was written by Ulvi Yurtsever \cite{Yurtsever} and the briefly explanation of the algorithmic randomness of quantum measurements results. There are…

Motivated by studying stochastic systems with non-Gaussian L\'evy noise, spectral properties for a type of linear cocycles are considered. These linear cocycles have countable jump discontinuities in time. A multiplicative ergodic theorem…

The Ku\v{c}era-G\'acs theorem is a landmark result in algorithmic randomness asserting that every real is computable from a Martin-L\"of random real. If the computation of the first $n$ bits of a sequence requires $n+h(n)$ bits of the…