Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke





.......................

.......................


Publications [#243848] of Jonathan C. Mattingly

Papers Published

  1. Mattingly, JC; Stuart, AM; Higham, DJ, Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise, Stochastic Processes and their Applications, vol. 101 no. 2 (October, 2002), pp. 185-232, ISSN 0304-4149 [MR2003i:60103], [pdf], [doi]
    (last updated on 2017/12/16)

    Abstract:
    The ergodic properties of SDEs, and various time discretizations for SDEs, are studied. The ergodicity of SDEs is established by using techniques from the theory of Markov chains on general state spaces. Application of these Markov chain results leads to straightforward proofs of ergodicity for a variety of SDEs, in particular for problems with degenerate noise and for problems with locally Lipschitz vector fields. The key points which need to be verified are the existence of a Lyapunov function inducing returns to a compact set, a uniformly reachable point from within that set, and some smoothness of the probability densities; the last two points imply a minorization condition. Together the minorization condition and Lyapunov structure give geometric ergodicity. Applications include the Langevin equation, the Lorenz equation with degenerate noise and gradient systems. The ergodic theorems proved are strong, yielding exponential convergence of expectations for classes of measurable functions restricted only by the condition that they grow no faster than the Lyapunov function. The same Markov chain theory is then used to study time-discrete approximations of these SDEs. It is shown that the minorization condition is robust under approximation. For globally Lipschitz vector fields this is also true of the Lyapunov condition. However in the locally Lipschitz case the Lyapunov condition fails for explicit methods such as Euler-Maruyama; it is, in general, only inherited by specially constructed implicit discretizations. Examples of such discretization based on backward Euler methods are given, and approximation of the Langevin equation studied in some detail.

 

dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320