arXiv · 1001.1433
Relative complexity of random walks in random sceneries
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 ($1<\alpha\le2$). The results give invariants for relative isomorphism of these.
Explore related subjects
Keep this discovery
Jon Aaronson. 2010-01-11. Relative complexity of random walks in random sceneries. https://doi.org/10.1214/11-aop688
Cite the original work for its findings. Save a collection to share your selection of sources.