Efficient Monte Carlo sampling by parallel marginalization

Mathematics – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 figures, 2 figures, PNAS .cls and .sty files, submitted to PNAS

Scientific paper

10.1073/pnas.0705418104

Markov chain Monte Carlo sampling methods often suffer from long correlation times. Consequently, these methods must be run for many steps to generate an independent sample. In this paper a method is proposed to overcome this difficulty. The method utilizes information from rapidly equilibrating coarse Markov chains that sample marginal distributions of the full system. This is accomplished through exchanges between the full chain and the auxiliary coarse chains. Results of numerical tests on the bridge sampling and filtering/smoothing problems for a stochastic differential equation are presented.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Efficient Monte Carlo sampling by parallel marginalization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Efficient Monte Carlo sampling by parallel marginalization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient Monte Carlo sampling by parallel marginalization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-651946

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.