Related papers: Ergodicity and Mixing of invariant capacities and …

We utilize an ergodic theory framework to explore sublinear expectation theory. Specifically, we investigate the pointwise Birkhoff's ergodic theorem for invariant sublinear expectation systems. By further assuming that these sublinear…

In this paper, we investigate capacity preserving transformations and their ergodicity. We show that for any measurable transformation $\theta$ there always exists a $\theta$-invariant capacity. We investigate some limit properties under…

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…

Under the notion of ergodicity of upper probability in the sense of Feng and Zhao (2021) that any invariant set either has capacity $0$ or its complement has capacity 0, we introduce the definition of finite ergodic components (FEC). We…

We prove strengthenings of the Birkhoff Ergodic Theorem for weakly mixing and strongly mixing measure preserving systems. We show that our pointwise theorem for weakly mixing systems is strictly stronger than the Wiener-Wintner Theorem. We…

Content of the lectures is the following. Properties of transformations equivalent to ergodicity. Birkhoff's Theorem. Properties equivalent to weak mixing. On typical properties of transformations. Lego to construct transformations. Typical…

The ergodic theorems of Hopf, Wiener and Birkhoff were extended to the context of Riesz spaces with a weak order unit and conditional expectation operator by Kuo, Labuschagne and Watson in [Ergodic Theory and the Strong Law of Large Numbers…

We study a stability property of probability laws with respect to small violations of algorithmic randomness. A sufficient condition of stability is presented in terms of Schnorr tests of algorithmic randomness. Most probability laws, like…

In this paper, we study the ergodicity of invariant sublinear expectation of sublinear Markovian semigroup. For this, we first develop an ergodic theory of an expectation-preserving map on a sublinear expectation space. Ergodicity is…

We prove that for an arbitrary indexing group, every ergodic infinitely divisible stationary process that is separable in probability is weakly mixing. This shows that, as in the well-known case of Gaussian stationary processes, ergodicity…

We introduce the notions of over- and under-independence for weakly mixing and (free) ergodic measure preserving actions and establish new results which complement and extend the theorems obtained in [BoFW] and [A]. Here is a sample of…

We investigate the well-posedness and long-time behavior of a general continuum neural field model with Gaussian noise on possibly unbounded domains. In particular, we give conditions for the existence of invariant probability measures by…

The celebrated Birkhoff Ergodic Theorem asserts that, for an ergodic map, orbits of almost every point equidistributes when sampled at integer times. This result was generalized by Bourgain to many natural sparse subsets of the integers. On…

It is well known that ergodic theory can be used to formally prove a weak form of relaxation to equilibrium for finite, mixing, Hamiltonian systems. In this Letter we extend this proof to any dynamics that preserves a mixing equilibrium…

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…

Eagleson's Theorem asserts that, given a probability-preserving map, ifrenormalized Birkhoff sums of a function converge in distribution, thenthey also converge with respect to any probability measure which isabsolutely continuous with…

We study the limit behaviour of upper and lower bounds on expected time averages in imprecise Markov chains; a generalised type of Markov chain where the local dynamics, traditionally characterised by transition probabilities, are now…

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…

Let $T \colon M \to M$ be a nonuniformly expanding dynamical system, such as logistic or intermittent map. Let $v \colon M \to \mathbb{R}^d$ be an observable and $v_n = \sum_{k=0}^{n-1} v \circ T^k$ denote the Birkhoff sums. Given a…

The classical Birkhoff ergodic theorem states that for an ergodic Markov process the limiting behaviour of the time average of a function (having finite $p$-th moment, $p\ge1$, with respect to the invariant measure) along the trajectories…