Relative Complexity of random walks in random sceneries

Details Relative Complexity of random walks in random sceneries Relative Complexity of random walks in random sceneries

2010-01-11

arxiv.org/abs/1001.1433v4

Mathematics

Dynamical Systems

New reference added and minor corrections made

Scientific paper

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 (alpha>1). The results give invariants for relative isomorphism of these.

Affiliated with

Also associated with

No associations

Rating

Relative Complexity of random walks in random sceneries does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Relative Complexity of random walks in random sceneries, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relative Complexity of random walks in random sceneries will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-718645