Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems

Résumé

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 [J. Avigad, P. Gerhardy, H. Towsner. Local stability of ergodic averages] that in a system whose dynamics is computable the ergodic averages of computable observables converge effectively. We give an alternative, simpler proof of this result. This implies that if also the invariant measure is computable then the pseudorandom points are a set which is dense (hence nonempty) on the support of the invariant measure.
Fichier principal
Vignette du fichier
1006.0392v1.pdf (113.15 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

inria-00517372 , version 1 (14-09-2010)

Identifiants

Citer

Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas. Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems. Computability and Complexity in Analysis (CCA), Jun 2010, Zhenjiang, China. pp.7-18, ⟨10.4204/EPTCS.24.6⟩. ⟨inria-00517372⟩
197 Consultations
132 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More