English
Related papers

Related papers: The dimension of ergodic random sequences

200 papers

Let $\{T^t\}$ be a smooth flow with positive speed and positive topological entropy on a compact smooth three dimensional manifold, and let $\mu$ be an ergodic measure of maximal entropy. We show that either $\{T^t\}$ is Bernoulli, or…

Dynamical Systems · Mathematics 2020-04-21 François Ledrappier , Yuri Lima , Omri Sarig

This work contributes to the programme of studying effective versions of "almost everywhere" theorems in analysis and ergodic theory via algorithmic randomness. We determine the level of randomness needed for a point in a Cantor space $…

Logic · Mathematics 2016-05-10 Rodney G. Downey , Satyadev Nandakumar , Andre Nies

We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

Analysis of PDEs · Mathematics 2020-01-22 Davit Martirosyan , Vahagn Nersesyan

Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…

Information Theory · Computer Science 2007-08-20 Marcus Hutter , Andrej Muchnik

In this paper, we investigate ergodic and fractal properties of the sets $$\Lambda_y:=\Big\{n\in\mathbb{N}:\ \{u_ny\}\in I_n\Big\},$$ where $\{\cdot\}$ denotes the fractional part function, $(u_n)_{n\in\mathbb{N}}$ is an increasing sequence…

Dynamical Systems · Mathematics 2025-10-10 Vicente Saavedra-Araya

If $S$ is an infinite sequence over a finite alphabet $\Sigma$ and $\beta$ is a probability measure on $\Sigma$, then the {\it dimension} of $ S$ with respect to $\beta$, written $\dim^\beta(S)$, is a constructive version of Billingsley…

Computational Complexity · Computer Science 2009-06-24 Jack H. Lutz

This paper studies ergodic properties of certain measures arising in the dynamics of holomorphic correspondences. These measures, in general, are not invariant in the classical sense of ergodic theory. We define a notion of ergodicity, and…

Dynamical Systems · Mathematics 2024-12-11 Mayuresh Londhe

Firstly we consider a finite dimensional Markov semigroup generated by Dunkl laplacian with drift terms. Using gradient bounds we show that for small coefficients this semigroup has an invariant measure. We then extend this analysis to an…

Mathematical Physics · Physics 2019-11-11 Andrei Velicu

Heap monoids equipped with Bernoulli measures are a model of probabilistic asynchronous systems. We introduce in this framework the notion of asynchronous stopping time, which is analogous to the notion of stopping time for classical…

Combinatorics · Mathematics 2015-05-21 Samy Abbes

This paper provides a complete proof of Simon-Lukic conjecture for orthogonal polynomials on the unit circle. For a probability measure $d\mu = w(\theta) \frac{d\theta}{2\pi} + d\mu_s$ with Verblunsky coefficients…

Spectral Theory · Mathematics 2026-01-27 Daxiong Piao

V'yugin has shown that there are a computable shift-invariant measure on Cantor space and a simple function f such that there is no computable bound on the rate of convergence of the ergodic averages A_n f. Here it is shown that in fact one…

Logic · Mathematics 2015-11-03 Jeremy Avigad

We study Doob's Consistency Theorem and Freedman's Inconsistency Theorem from the vantage point of computable probability and algorithmic randomness. We show that the Schnorr random elements of the parameter space are computably consistent,…

Logic · Mathematics 2025-01-22 Simon M. Huttegger , Sean Walsh , Francesca Zaffora Blando

We initiate a study of the following problem: Given a continuous domain $\Omega$ along with its convex hull $\mathcal{K}$, a point $A \in \mathcal{K}$ and a prior measure $\mu$ on $\Omega$, find the probability density over $\Omega$ whose…

Data Structures and Algorithms · Computer Science 2020-04-17 Jonathan Leake , Nisheeth K. Vishnoi

The aim of this paper is to show how extracting dynamical behavior and ergodic properties from deterministic chaos with the assistance of exact invariant measures. On the one hand, we provide an approach to deal with the inverse problem of…

Chaotic Dynamics · Physics 2015-06-24 Roberto Venegeroles

We consider an ergodic invariant measure $\mu$ for a smooth action of $Z^k$, $k \ge 2$, on a $(k+1)$-dimensional manifold or for a locally free smooth action of $R^k$, $k \ge 2$ on a $(2k+1)$-dimensional manifold. We prove that if $\mu$ is…

Dynamical Systems · Mathematics 2010-09-14 Boris Kalinin , Anatole Katok , Federico Rodriguez Hertz

In this note we obtain tight bounds on the space-complexity of computing the ergodic measure of a low-dimensional discrete-time dynamical system affected by Gaussian noise. If the scale of the noise is $\varepsilon$, and the function…

Computational Complexity · Computer Science 2015-08-24 Mark Braverman , Cristobal Rojas , Jon Schneider

This study investigates the natural or intrinsic measure of a symbolic dynamical system $\Sigma$. The measure $\mu([i_{1},i_{2},...,i_{n}])$ of a pattern $[i_{1},i_{2},...,i_{n}]$ in $\Sigma$ is an asymptotic ratio of…

Dynamical Systems · Mathematics 2013-08-15 Wen-Guei Hu , Song-Sun Lin

We study a wide class of metrics in a Lebesgue space with a standard measure, the class of so-called admissible metrics. We consider the cone of admissible metrics, introduce a special norm in it, prove compactness criteria, define the…

Dynamical Systems · Mathematics 2012-10-26 A. Vershik , F. Petrov , P. Zatitskiy

Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…

Dynamical Systems · Mathematics 2026-01-14 Philipp Gohlke , Andrew Mitchell , Dan Rust , Tony Samuel

This paper explores a novel definition of Schnorr randomness for noncomputable measures. We say $x$ is uniformly Schnorr $\mu$-random if $t(\mu,x)<\infty$ for all lower semicomputable functions $t(\mu,x)$ such that $\mu\mapsto\int…

Logic · Mathematics 2017-08-08 Jason Rute
‹ Prev 1 3 4 5 6 7 10 Next ›