相关论文: Uncomputably noisy ergodic limits

For a Dunford-Schwartz operator in the $L^p-$space, $1\leq p< \infty$ , of an arbitrary measure space, we prove pointwise convergence of the conventional and Besicovitch weighted ergodic averages. Pointwise convergence of various types of…

For a class of irrational numbers, depending on their Diophantine properties, we construct explicit rank-one transformations that are totally ergodic and not weakly mixing. We classify when the measure is finite or infinite. In the finite…

We study fluctuations of ergodic averages generated by actions of amenable groups. In the setting of an abstract ergodic theorem for locally compact second countable amenable groups acting on uniformly convex Banach spaces, we deduce a…

A unified view is given to recent developments about a systematic method of constructing rational mappings as ergodic transformations with non-uniform invariant measures on the unit interval I=[0,1]. All of the rational ergodic mappings of…

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

Questions of noise stability play an important role in hardness of approximation in computer science as well as in the theory of voting. In many applications, the goal is to find an optimizer of noise stability among all possible partitions…

This paper is devoted to study ergodic optimisation problems for almost-additive sequences of functions (rather than a fixed potential) defined over countable Markov shifts (that is a non-compact space). Under certain assumptions we prove…

We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…

For a Dunford-Schwartz operator in a fully symmetric space of measurable functions of an arbitrary measure space, we prove pointwise convergence of the conventional and weighted ergodic averages.

An example due to Erdos and Fortet shows that, for a lacunary sequence of integers (q_n) and a trigonometric polynomial f, the asymptotic distribution of normalized sums of f(q_k x) can be a mixture of gaussian laws. Here we give a…

A measure preserving action of a countably infinite group \Gamma is called totally ergodic if every infinite subgroup of \Gamma acts ergodically. For example, all mixing and mildly mixing actions are totally ergodic. This note shows that if…

In this paper we consider the computational complexity of uniformizing a domain with a given computable boundary. We give nontrivial upper and lower bounds in two settings: when the approximation of boundary is given either as a list of…

The Birkhoff Ergodic Theorem concludes that time averages, i.e., Birkhoff averages, $\Sigma_{n=0}^{N-1} f(x_n)/N$ of a function $f$ along a length $N$ ergodic trajectory $(x_n)$ of a function $T$ converge to the space average $\int f d\mu$,…

Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\mathbb{N}}$ for uncountable covers.…

Let $f:[0,1]^d\to\mathbb{R}$ be a completely monotone integrand as defined by Aistleitner and Dick (2015) and let points $\boldsymbol{x}_0,\dots,\boldsymbol{x}_{n-1}\in[0,1]^d$ have a non-negative local discrepancy (NNLD) everywhere in…

It is shown that a class of optical physical unclonable functions (PUFs) can be learned to arbitrary precision with arbitrarily high probability, even in the presence of noise, given access to polynomially many challenge-response pairs and…

Analogue gravity helps to find some gravitational systems which are similar to the evolution of perturbation in condensed matter systems. These analogies provide a very good tool for either side. In other words, some aspects of gravity…

We prove that the entropy map for countable Markov shifts of finite entropy is upper semi-continuous at ergodic measures. Note that the phase space is non-compact. Applications to systems that can be coded by these shifts, such as positive…

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…

A new negative result for nonparametric estimation of binary ergodic processes is shown. I The problem of estimation of distribution with any degree of accuracy is studied. Then it is shown that for any countable class of estimators there…