Related papers: Uncomputably noisy ergodic limits
We show that for a potential with summable variations on an irreducible sofic shift in one dimension, the equilibrium measures are precisely the shift-invariant Gibbs measures. The main tool in the proof is a preservation of Gibbsianness…
The existence of measure preserving invertible transformations $T$ with simple spectrum is established possessing the following rate of correlation decay $(f(T^k x), f(x)) = O(|k|^{-1/2+{\epsilon}})$ for a dense family of functions $f$ and…
The laws of quantum physics place a limit on the speed of computation. In particular, the evolution time of a system from an initial state to a final state cannot be arbitrarily short. Bounds on the speed of evolution for unitary dynamics…
We consider the question of computing invariant measures from an abstract point of view. We work in a general framework (computable metric spaces, computable measures and functions) where this problem can be posed precisely. We consider…
We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…
For an ergodic action of the group $Z^n$ on a probability space and a given arbitrarily slowly decreasing to zero sequence, there exists an integrable function such that the standard ergodic time averages for it converge almost everywhere…
Brolin-Lyubich measure $\lambda_R$ of a rational endomorphism $R:\riem\to\riem$ with $\deg R\geq 2$ is the unique invariant measure of maximal entropy $h_{\lambda_R}=h_{\text{top}}(R)=\log d$. Its support is the Julia set $J(R)$. We…
We comment on recent results in the field of information based complexity, which state (in a number of different settings), that approximation of infinitely differentiable functions is intractable and suffers from the curse of…
Given an ergodic probability measure preserving dynamical system $\G\acts (X,\mu)$, where $\G$ is a finitely generated countable group, we show that the asymptotic growth of the number of finite models for the dynamics, in the sense of…
Gaussian bounds on noise correlation of functions play an important role in hardness of approximation, in quantitative social choice theory and in testing. The author (2008) obtained sharp gaussian bounds for the expected correlation of…
The problem of finding an optimum using noisy evaluations of a smooth cost function arises in many contexts, including economics, business, medicine, experiment design, and foraging theory. We derive an asymptotic bound E[ (x_t - x*)^2 ] >=…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…
Brownian motion and scaled and interpolated simple random walk can be jointly embedded in a probability space in such a way that almost surely the $n$-step walk is within a uniform distance $O(n^{-1/2}\log n)$ of the Brownian path for all…
Quantum ergodicity asserts that almost all infinite sequences of eigenstates of a quantized ergodic system are equidistributed in the phase space. On the other hand, there are might exist exceptional sequences which converge to different…
We address the problem of upper bounding the mean square error of MCMC estimators. Our analysis is nonasymptotic. We first establish a general result valid for essentially all ergodic Markov chains encountered in Bayesian computation and a…
Suppose that G is a compact Abelian topological group, m is the Haar measure on G and f is a measurable function. Given (n_k), a strictly monotone increasing sequence of integers we consider the nonconventional ergodic/Birkhoff averages…
In the noisy query model, the (binary) return value of every query (possibly repeated) is independently flipped with some fixed probability $p \in (0, 1/2)$. In this paper, we obtain tight bounds on the noisy query complexity of several…
We establish an uncountable amenable ergodic Roth theorem, in which the acting group is not assumed to be countable and the space need not be separable. This generalizes a previous result of Bergelson, McCutcheon and Zhang, and complements…
We analyse the maximum achievable rate of sustained computation for a given convex region of three dimensional space subject to geometric constraints on power delivery and heat dissipation. We find a universal upper bound across both…
We study distribution-free nonparametric regression following a notion of average smoothness initiated by Ashlagi et al. (2021), which measures the "effective" smoothness of a function with respect to an arbitrary unknown underlying…