Relative complexity of random walks in random sceneries
Dynamical Systems
2012-10-30 v5 Probability
Abstract
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 \alpha-stable CLT (). The results give invariants for relative isomorphism of these.
Keywords
Cite
@article{arxiv.1001.1433,
title = {Relative complexity of random walks in random sceneries},
author = {Jon Aaronson},
journal= {arXiv preprint arXiv:1001.1433},
year = {2012}
}
Comments
Published in at http://dx.doi.org/10.1214/11-AOP688 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org)