# Monte Carlo Sampling Methods Using Markov Chains and Their Applications

```@article{Hastings1970MonteCS,
title={Monte Carlo Sampling Methods Using Markov Chains and Their Applications},
author={W. K. Hastings},
journal={Biometrika},
year={1970},
volume={57},
pages={97-109}
}```
SUMMARY A generalization of the sampling method introduced by Metropolis et al. (1953) is presented along with an exposition of the relevant theory, techniques of application and methods and difficulties of assessing the error in Monte Carlo estimates. Examples of the methods, including the generation of random orthogonal matrices and potential applications of the methods to numerical problems arising in statistics, are discussed. For numerical problems in a large number of dimensions, Monte…
13,743 Citations
Introduction to Markov Chain Monte Carlo Methods in Molecular Evolution
Markov chain Monte Carlo has proved to be highly useful because of its great flexibility and its success at solving many high-dimensional integration problems where other methods are computationally prohibitive.
A Guide to Exact Simulation
The results show that CFTP works at least as well as standard MCMC, with convergence monitored by the method of Raftery & Lewis (1992, 1996).
Asymptotically Independent Markov Sampling: a new MCMC scheme for Bayesian Inference
• Computer Science
• 2011
This paper introduces a new scheme for Bayesian inference, called Asymptotically Independent Markov Sampling (AIMS), which is based on the Markov chain Monte Carlo method and derives important ergodic properties of AIMS.
Monte Carlo Methods for Statistical Inference
Various ways random numbers are used in statistical inference are discussed, including Monte Carlo methods and pseudorandom numbers, which is a sample constrained to reflect closely the distribution of the population the authors are simulating.
Estimation via Markov chain Monte Carlo
• J. Spall
• Computer Science, Mathematics
Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301)
• 2002
A survey of popular implementations of Markov chain Monte Carlo, focusing especially on the two most popular specific implementations of MCMC: Metropolis-Hastings and Gibbs sampling.
Markov Chain Monte Carlo and Gibbs Sampling
This work focuses here on Markov Chain Monte Carlo (MCMC) methods, which attempt to simulate direct draws from some complex distribution of interest, and on the powerful machinery of MCMC methods,which have their roots in the Metropolis algorithm.
A survey of Monte Carlo methods for parameter estimation
• Computer Science
• 2020
A thorough review of MC methods for the estimation of static parameters in signal processing applications is performed, describing many of the most relevant MCMC and IS algorithms, and their combined use.
High dimensional Markov chain Monte Carlo methods : theory, methods and applications
The analysis of Markov Chain Monte Carlo (MCMC) methods and the development of new methodologies to sample from a high dimensional distribution and new Metropolis-Hastings type algorithms which have a better optimal scaling compared the MALA algorithm are studied.
The application of Monte Carlo methods for learning generalized linear model
• B. Jia
• Computer Science
Biometrics & Biostatistics International Journal
• 2018
The Monte Carlo method for calculating coefficients in Generalized Linear Model (GLM) and Stochastic Approximation in Monte Carlo Computation (SAMC) is introduced.
A simulation approach to convergence rates for Markov chain Monte Carlo algorithms
• Computer Science
Stat. Comput.
• 1998
This paper proposes the use of auxiliary simulations to estimate the numerical values needed in this theorem and makes it possible to compute quantitative convergence bounds for models for which the requisite analytical computations would be prohibitively difficult or impossible.