This work presents a version of the Metropolis-Hastings algorithm using quasi-Monte Carlo inputs. We prove that the method yields consistent estimates in some problems with finite state spaces and completely uniformly distributed inputs. In some numerical examples, the proposed method is much more accurate than ordinary Metropolis-Hastings sampling.
Download full-text PDF |
Source |
---|---|
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC1150275 | PMC |
http://dx.doi.org/10.1073/pnas.0409596102 | DOI Listing |
Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!