Averaging of Hamiltonian flows with an ergodic component

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Published in at http://dx.doi.org/10.1214/07-AOP372 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of

Scientific paper

10.1214/07-AOP372

We consider a process on $\mathbb{T}^2$, which consists of fast motion along the stream lines of an incompressible periodic vector field perturbed by white noise. It gives rise to a process on the graph naturally associated to the structure of the stream lines of the unperturbed flow. It has been shown by Freidlin and Wentzell [Random Perturbations of Dynamical Systems, 2nd ed. Springer, New York (1998)] and [Mem. Amer. Math. Soc. 109 (1994)] that if the stream function of the flow is periodic, then the corresponding process on the graph weakly converges to a Markov process. We consider the situation where the stream function is not periodic, and the flow (when considered on the torus) has an ergodic component of positive measure. We show that if the rotation number is Diophantine, then the process on the graph still converges to a Markov process, which spends a positive proportion of time in the vertex corresponding to the ergodic component of the flow.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Averaging of Hamiltonian flows with an ergodic component 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 Averaging of Hamiltonian flows with an ergodic component, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Averaging of Hamiltonian flows with an ergodic component will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-566389

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.