Mathematics – Probability
Scientific paper
2007-01-14
Mathematics
Probability
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.
Benjamini Itai
Morris Ben
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-122196