Papers
Topics
Authors
Recent
Search
2000 character limit reached

Faster than expected escape for a class of fully chaotic maps

Published 30 Jul 2012 in nlin.CD, math-ph, math.DS, and math.MP | (1207.7000v2)

Abstract: We investigate the dependence of the escape rate on the position of a hole placed in uniformly hyperbolic systems admitting a finite Markov partition. We derive an exact periodic orbit formula for finite size Markov holes which differs from other periodic expansions in the literature and can account for additional distortion to maps with piecewise constant expansion rate. Using asymptotic expansions in powers of hole size we show that for systems conjugate to the binary shift, the average escape rate is always larger than the expectation based on the hole size. Moreover, we show that in the small hole limit the difference between the two decays like a known constant times the square of the hole size. Finally, we relate this problem to the random choice of hole positions and we discuss possible extensions of our results to non-Markov holes as well as applications to leaky dynamical networks.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.