Result: Regenerative Markov Chain Monte Carlo for Any Distribution

Title:
Regenerative Markov Chain Monte Carlo for Any Distribution
Source:
Communications in statistics. Simulation and computation. 41(8-10):1745-1760
Publisher Information:
Colchester: Taylor & Francis, 2012.
Publication Year:
2012
Physical Description:
print, 1 p.1/4
Original Material:
INIST-CNRS
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
Department of ISDS, California State University, Fullerton, California, United States
Biosciences Division, Argonne National Laboratory, Argonne, Illinois, United States
Department of Mathematics, California State University, Fullerton, California, United States
ISSN:
0361-0918
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.26164020
Database:
PASCAL Archive

Further Information

While Markov chain Monte Carlo (MCMC) methods are frequently used for difficult calculations in a wide range of scientific disciplines, they suffer from a serious limitation: their samples are not independent and identically distributed. Consequently, estimates of expectations are biased if the initial value of the chain is not drawn from the target distribution. Regenerative simulation provides an elegant solution to this problem. In this article, we propose a simple regenerative MCMC algorithm to generate varieties for any distribution.