Regenerative Markov Chain Monte Carlo for any distribution.
Journal Article
·
· Communications in Statistics, Part B: Simulation and Computation
- Biosciences Division
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 variates for any distribution
- Research Organization:
- Argonne National Laboratory (ANL)
- Sponsoring Organization:
- SC
- DOE Contract Number:
- AC02-06CH11357
- OSTI ID:
- 1047434
- Report Number(s):
- ANL/BIO/JA-66161
- Journal Information:
- Communications in Statistics, Part B: Simulation and Computation, Journal Name: Communications in Statistics, Part B: Simulation and Computation Journal Issue: 9 Vol. 41; ISSN 0361-0918
- Country of Publication:
- United States
- Language:
- ENGLISH
Similar Records
Challenges in Markov Chain Monte Carlo for Bayesian Neural Networks
Finding noncommunicating sets for Markov chain Monte Carlo estimations on pedigrees
Accelerating Markov chain Monte Carlo simulation by differential evolution with self-adaptive randomized subspace sampling
Journal Article
·
Mon Jun 20 20:00:00 EDT 2022
· Statistical Science
·
OSTI ID:1976073
Finding noncommunicating sets for Markov chain Monte Carlo estimations on pedigrees
Journal Article
·
Thu Mar 31 23:00:00 EST 1994
· American Journal of Human Genetics; (United States)
·
OSTI ID:7105174
Accelerating Markov chain Monte Carlo simulation by differential evolution with self-adaptive randomized subspace sampling
Journal Article
·
Mon Dec 31 23:00:00 EST 2007
· International Journal of Nonlinear Sciences and Numerical Simulation
·
OSTI ID:960766