Relative complexity of random walks in random sceneries

• Autores: Jon Aaronson
• Localización: Annals of probability: An official journal of the Institute of Mathematical Statistics, ISSN 0091-1798, Vol. 40, Nº. 6, 2012, págs. 2460-2482
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Relative complexity measures the complexity of a probability preserving transformation relative to a factor being a sequence of random variables whose exponential growth rate is the relative entropy of the extension. We prove distributional limit theorems for the relative complexity of certain zero entropy extensions: RWRSs whose associated random walks satisfy the α-stable CLT (1<α≤2). The results give invariants for relative isomorphism of these.