Methodology and Computing in Applied Probability

, Volume 13, Issue 4, pp 835–854 | Cite as

Stability of Partially Implicit Langevin Schemes and Their MCMC Variants

  • Bruno Casella
  • Gareth Roberts
  • Osnat StramerEmail author


A broad class of implicit or partially implicit time discretizations for the Langevin diffusion are considered and used as proposals for the Metropolis–Hastings algorithm. Ergodic properties of our proposed schemes are studied. We show that introducing implicitness in the discretization leads to a process that often inherits the convergence rate of the continuous time process. These contrast with the behavior of the naive or Euler–Maruyama discretization, which can behave badly even in simple cases. We also show that our proposed chains, when used as proposals for the Metropolis–Hastings algorithm, preserve geometric ergodicity of their implicit Langevin schemes and thus behave better than the local linearization of the Langevin diffusion. We illustrate the behavior of our proposed schemes with examples. Our results are described in detail in one dimension only, although extensions to higher dimensions are also described and illustrated.


Langevin diffusions Ergodicity Implicit Euler schemes: discrete approximation 

AMS 2000 Subject Classifications

60J60 60Jxx 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Besag JE (1994) Comments on “representation of knowledge in complex systems” by U. Grenander and M.I. Miller. J R Stat Soc, Ser B 56:591–592Google Scholar
  2. Beskos A, Papaspiliopoulos O, Roberts GO (2008a) A new factorisation of diffusion measure and sample path reconstruction. Methodol Comput Appl Probab 10:85–104MathSciNetzbMATHCrossRefGoogle Scholar
  3. Beskos A, Roberts GO, Stuart A, Voss J (2008b) MCMC methods for diffusion bridges. Stoch Dyn 8:319–350MathSciNetzbMATHCrossRefGoogle Scholar
  4. Christensen OF, Roberts GO, Sköld M (2006) Robust Markov chain Monte Carlo methods for spatial generalized linear mixed models. J Comput Graph Stat 15:1–17CrossRefGoogle Scholar
  5. Doll JD, Rossky PJ, Friedman KL (1978) Brownian dynamics as smart Monte Carlo simulation. J Chem Phys 69:4628–4633CrossRefGoogle Scholar
  6. Hansen NR (2003) Geometric ergodicity of discrete-time approximations to multivariate diffusions. Bernoulli 9:725–743MathSciNetzbMATHCrossRefGoogle Scholar
  7. Higham DJ (2000) Mean-square and asymptotic stability of the stochastic theta method. SIAM J Numer Anal 38:753–769 (electronic)MathSciNetzbMATHCrossRefGoogle Scholar
  8. Kloeden P, Platen E (1992) Numerical solutions of stochastic differential equations. Springer, BerlinGoogle Scholar
  9. Mattingly JC, Stuart AM, Higham DJ (2002) Ergodicity for SDEs and approximations: locally Lipschitz vector fields and degenerate noise. Stoch Process their Appl 101:185–232MathSciNetzbMATHCrossRefGoogle Scholar
  10. Mengersen KL, Tweedie RL (1996) Rates of convergence of the Hastings and Metropolis algorithms. Ann Stat 24:101–121MathSciNetzbMATHCrossRefGoogle Scholar
  11. Meyn SP, Tweedie RL (1993) Markov chains and stochastic stability. In: Communications and control engineering series. Springer London Ltd., LondonGoogle Scholar
  12. Roberts GO, Tweedie RL (1996a) Exponential convergence of Langevin distributions and their discrete approximations. Bernoulli 2:341–363MathSciNetzbMATHCrossRefGoogle Scholar
  13. Roberts GO, Tweedie RL (1996b) Geometric convergence and central limit theorems for multidimensional Hastings and Metropolis algorithms. Biometrika 83:95–110MathSciNetzbMATHCrossRefGoogle Scholar
  14. Saito Y, Mitsui T (1996) Stability analysis of numerical schemes for stochastic differential equations. SIAM J Numer Anal 33:2254–2267MathSciNetzbMATHCrossRefGoogle Scholar
  15. Shoji I, Ozaki T (1998) Estimation for nonlinear stochastic differential equations by a local linearization method. Stoch Anal Appl 16:733–752MathSciNetzbMATHCrossRefGoogle Scholar
  16. Stramer O, Tweedie RL (1999) Langevin-type models. II. Self-targeting candidates for MCMC algorithms. Methodol Comput Appl Probab 1:307–328MathSciNetzbMATHCrossRefGoogle Scholar
  17. Stuart AM, Humphries AR (1996) Dynamical systems and numerical analysis. In: Cambridge monographs on applied and computational mathematics, vol 2. Cambridge University Press, CambridgeGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.McKinsey & CompanyMilanItaly
  2. 2.Department of StatisticsUniversity of WarwickWarwickUK
  3. 3.Department of Statistics and Actuarial ScienceUniversity of IowaIowaUSA

Personalised recommendations