The birthday problem and Markov chain Monte Carlo

Mathematics – Probability

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We study the problem of generating a sample from the stationary distribution of a Markov chain, given a method to simulate the chain. We give an approximation algorithm for the case of a random walk on a regular graph with n vertices that runs in expected time O^*(\sqrt{n} x L^2-mixing time). This is close to the best possible, since \sqrt{n} is a lower bound on the worst-case expected running time of any algorithm.

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

The birthday problem and Markov chain Monte Carlo 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 The birthday problem and Markov chain Monte Carlo, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The birthday problem and Markov chain Monte Carlo will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-122196

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