IDEAS home Printed from https://ideas.repec.org/a/eee/spapps/v101y2002i2p185-232.html
   My bibliography  Save this article

Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise

Author

Listed:
  • Mattingly, J. C.
  • Stuart, A. M.
  • Higham, D. J.

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, such as that expounded by Meyn-Tweedie. Application of these Markov chain results leads to straightforward proofs of geometric ergodicity for a variety of SDEs, including problems with degenerate noise and for problems with locally Lipschitz vector fields. Applications where this theory can be usefully applied include damped-driven Hamiltonian problems (the Langevin equation), the Lorenz equation with degenerate noise and gradient systems. The same Markov chain theory is then used to study time-discrete approximations of these SDEs. The two primary ingredients for ergodicity are a minorization condition and a Lyapunov condition. 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; for pathwise approximations 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.

Suggested Citation

  • Mattingly, J. C. & Stuart, A. M. & Higham, D. J., 2002. "Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise," Stochastic Processes and their Applications, Elsevier, vol. 101(2), pages 185-232, October.
    • Handle: RePEc:eee:spapps:v:101:y:2002:i:2:p:185-232
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304-4149(02)00150-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Roberts, G. O. & Tweedie, R. L., 1999. "Bounds on regeneration times and convergence rates for Markov chains," Stochastic Processes and their Applications, Elsevier, vol. 80(2), pages 211-229, April.
    2. Veretennikov, A. Yu., 1997. "On polynomial mixing bounds for stochastic differential equations," Stochastic Processes and their Applications, Elsevier, vol. 70(1), pages 115-127, October.
    3. Gareth O. Roberts & Jeffrey S. Rosenthal, 1998. "Optimal scaling of discrete approximations to Langevin diffusions," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 60(1), pages 255-268.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yang, Jun & Roberts, Gareth O. & Rosenthal, Jeffrey S., 2020. "Optimal scaling of random-walk metropolis algorithms on general target distributions," Stochastic Processes and their Applications, Elsevier, vol. 130(10), pages 6094-6132.
    2. Quan Zhou & Jun Yang & Dootika Vats & Gareth O. Roberts & Jeffrey S. Rosenthal, 2022. "Dimension‐free mixing for high‐dimensional Bayesian variable selection," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 84(5), pages 1751-1784, November.
    3. Jorge I. Figueroa-Zúñiga & Cristian L. Bayes & Víctor Leiva & Shuangzhe Liu, 2022. "Robust beta regression modeling with errors-in-variables: a Bayesian approach and numerical applications," Statistical Papers, Springer, vol. 63(3), pages 919-942, June.
    4. Anatolii A. Puhalskii, 2003. "On Large Deviation Convergence of Invariant Measures," Journal of Theoretical Probability, Springer, vol. 16(3), pages 689-724, July.
    5. Jarner, Søren Fiig & Hansen, Ernst, 2000. "Geometric ergodicity of Metropolis algorithms," Stochastic Processes and their Applications, Elsevier, vol. 85(2), pages 341-361, February.
    6. Yuji Sakamoto & Nakahiro Yoshida, 2009. "Third-order asymptotic expansion of M-estimators for diffusion processes," Annals of the Institute of Statistical Mathematics, Springer;The Institute of Statistical Mathematics, vol. 61(3), pages 629-661, September.
    7. Mamatzakis, Emmanuel C. & Tsionas, Mike G., 2021. "Making inference of British household's happiness efficiency: A Bayesian latent model," European Journal of Operational Research, Elsevier, vol. 294(1), pages 312-326.
    8. Gael M. Martin & David T. Frazier & Christian P. Robert, 2020. "Computing Bayes: Bayesian Computation from 1763 to the 21st Century," Monash Econometrics and Business Statistics Working Papers 14/20, Monash University, Department of Econometrics and Business Statistics.
    9. Guillin, A. & Liptser, R., 2005. "MDP for integral functionals of fast and slow processes with averaging," Stochastic Processes and their Applications, Elsevier, vol. 115(7), pages 1187-1207, July.
    10. Fort, G. & Moulines, E., 2003. "Polynomial ergodicity of Markov transition kernels," Stochastic Processes and their Applications, Elsevier, vol. 103(1), pages 57-99, January.
    11. Delis, Manthos D. & Tsionas, Mike G., 2018. "Measuring management practices," International Journal of Production Economics, Elsevier, vol. 199(C), pages 65-77.
    12. Cayé, Thomas & Herdegen, Martin & Muhle-Karbe, Johannes, 2020. "Scaling limits of processes with fast nonlinear mean reversion," Stochastic Processes and their Applications, Elsevier, vol. 130(4), pages 1994-2031.
    13. Anatolii A. Puhalskii & Michael Jay Stutzer, 2016. "On minimising a portfolio's shortfall probability," Papers 1602.02192, arXiv.org, revised May 2017.
    14. Dalalyan, Arnak S. & Karagulyan, Avetik, 2019. "User-friendly guarantees for the Langevin Monte Carlo with inaccurate gradient," Stochastic Processes and their Applications, Elsevier, vol. 129(12), pages 5278-5311.
    15. Aknouche, Abdelhakim & Dimitrakopoulos, Stefanos, 2020. "On an integer-valued stochastic intensity model for time series of counts," MPRA Paper 105406, University Library of Munich, Germany.
    16. Alexander Veretennikov, 2023. "Polynomial Recurrence for SDEs with a Gradient-Type Drift, Revisited," Mathematics, MDPI, vol. 11(14), pages 1-16, July.
    17. Arnak S. Dalalyan, 2017. "Theoretical guarantees for approximate sampling from smooth and log-concave densities," Journal of the Royal Statistical Society Series B, Royal Statistical Society, vol. 79(3), pages 651-676, June.
    18. O. F. Christensen & J. Møller & R. P. Waagepetersen, 2001. "Geometric Ergodicity of Metropolis-Hastings Algorithms for Conditional Simulation in Generalized Linear Mixed Models," Methodology and Computing in Applied Probability, Springer, vol. 3(3), pages 309-327, September.
    19. M Ludkin & C Sherlock, 2023. "Hug and hop: a discrete-time, nonreversible Markov chain Monte Carlo algorithm," Biometrika, Biometrika Trust, vol. 110(2), pages 301-318.
    20. Jeffrey S. Rosenthal, 2003. "Geometric Convergence Rates for Time-Sampled Markov Chains," Journal of Theoretical Probability, Springer, vol. 16(3), pages 671-688, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:spapps:v:101:y:2002:i:2:p:185-232. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/505572/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.