Optimal scaling of discrete approximations to Langevin diffusions

$48.00 plus tax (Refund Policy)

Download / Buy Article:


We consider the optimal scaling problem for proposal distributions in Hastings–Metropolis algorithms derived from Langevin diffusions. We prove an asymptotic diffusion limit theorem and show that the relative efficiency of the algorithm can be characterized by its overall acceptance rate, independently of the target distribution. The asymptotically optimal acceptance rate is 0.574. We show that, as a function of dimension n, the complexity of the algorithm is O(n1/3), which compares favourably with the O(n) complexity of random walk Metropolis algorithms. We illustrate this comparison with some example simulations.

Keywords: Hastings–Metropolis algorithm; Langevin algorithm; Markov chain Monte Carlo method; Weak convergence

Document Type: Original Article

DOI: http://dx.doi.org/10.1111/1467-9868.00123

Affiliations: 1: University of Cambridge, UK, 2: University of Toronto, Canada

Publication date: January 1, 1998

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more