© 1973 by Biometrika Trust
Optimum Monte-Carlo sampling using Markov chains
York University Toronto
The sampling method proposed by Metropolis et al. (1953) requires the simulation of a Markov chain with a specified
as its stationary distribution. Hastings (1970) outlined a general procedure for constructing and simulating such a Markov chain. The matrix P of transition probabilities is constructed using a defined symmetric function sij and an arbitrary transition matrix Q. Here, for a given Q, the relative merits of the two simple choices for sij suggested by Hastings (1970) are discussed. The optimum choice for sij is shown to be one of these. For the other choice, those Q are given which are known to make the sampling method based on P asymptotically less precise than independent sampling.
Key Words: Monte-Carlo estimation Markov chain method of sampling Variance reduction Simulation
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
J. Gill Is Partial-Dimension Convergence a Problem for Inferences from MCMC Algorithms? Political Analysis, April 1, 2008; 16(2): 153 - 178. [Abstract] [Full Text] [PDF] |
||||
![]() |
V. Kadirkamanathan, J. Yang, S. A. Billings, and P. C. Wright Markov Chain Monte Carlo Algorithm based metabolic flux distribution analysis on Corynebacterium glutamicum Bioinformatics, November 1, 2006; 22(21): 2681 - 2687. [Abstract] [Full Text] [PDF] |
||||

