Geometric singular perturbation theory for stochastic differential equations

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

43 pages. Published version. Remarks added, minor corrections

Scientific paper

10.1016/S0022-0396(03)00020-2

We consider slow-fast systems of differential equations, in which both the slow and fast variables are perturbed by noise. When the deterministic system admits a uniformly asymptotically stable slow manifold, we show that the sample paths of the stochastic system are concentrated in a neighbourhood of the slow manifold, which we construct explicitly. Depending on the dynamics of the reduced system, the results cover time spans which can be exponentially long in the noise intensity squared (that is, up to Kramers' time). We obtain exponentially small upper and lower bounds on the probability of exceptional paths. If the slow manifold contains bifurcation points, we show similar concentration properties for the fast variables corresponding to non-bifurcating modes. We also give conditions under which the system can be approximated by a lower-dimensional one, in which the fast variables contain only bifurcating modes.

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

Geometric singular perturbation theory for stochastic differential equations 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 Geometric singular perturbation theory for stochastic differential equations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geometric singular perturbation theory for stochastic differential equations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-412941

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