Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior as a typical point of the system. It was proved in [Avigad et al. 2010, Local stability of ergodic averages] that in a system whose dyn...
Main Authors: | Stefano Galatolo, Mathieu Hoyrup, Cristóbal Rojas |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2010-06-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1006.0392v1 |
Similar Items
-
Convergence of the Least Squares Shadowing Method for Computing Derivative of Ergodic Averages
by: Wang, Qiqi
Published: (2014) -
Uniform Convergence of Cesaro Averages for Uniquely Ergodic <i>C</i><sup>*</sup>-Dynamical Systems
by: Francesco Fidaleo
Published: (2018-12-01) -
On the minimum ergodic average and minimal systems
by: Manuel Saavedra, et al.
Published: (2022-12-01) -
Computational ergodic theory /
by: 428113 Choe, Geon Ho
Published: (2005) -
Robustness of Average-Case Meta-Complexity via Pseudorandomness
by: Ilango, Rahul, et al.
Published: (2022)