Skip to main content
Geometric ergodicity of a random-walk Metropolis algorithm for a transformed density
Johnson, Leif; Geyer, Charles J. (2010)
 

Title 
Geometric ergodicity of a random-walk Metropolis algorithm for a transformed density

Issue Date
2010-11-22

Abstract
Curvature conditions on a target density in R^k for the geometric ergodicity of a random-walk Metropolis algorithm have previously been established (Mengersen and Tweedie(1996), Roberts and Tweedie(1996), Jarner and Hansen(2000)). However, the conditions for target densities in R^k that have exponentially light tails, but are not super-exponential are difficult to apply. In this paper I establish a variable transformation to apply to such target densities, that along with a regularity condition on the target density, ensures that a random-walk Metropolis algorithm for the transformed density is geometrically ergodic. Inference can be drawn for the original target density using Markov chain Monte Carlo estimates based on the transformed density. An application to inference on the regression parameter in multinomial logit regression with a conjugate prior is given.

Appears in Collection(s)

Series/Report Number
Technical Report
680

Suggested Citation
Johnson, Leif; Geyer, Charles J.. (2010). Geometric ergodicity of a random-walk Metropolis algorithm for a transformed density. Retrieved from the University of Minnesota Digital Conservancy, http://purl.umn.edu/96959.


Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.