RELATIVE COMPLEXITY OF RANDOM WALKS IN RANDOM SCENERIES

• 成果类型: Article
• 署名作者: Aaronson, Jon
• 署名单位: Tel Aviv University
• 刊物名称: ANNALS OF PROBABILITY
• ISSN/ISSBN: 0091-1798
• DOI: 10.1214/11-AOP688
• 发表日期: 2012
• 页码: 2460-2482
• 关键词: entropy; THEOREM; EQUIVALENCE

摘要

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 <= 2). The results give invariants for relative isomorphism of these.