Mathematics – Probability
Scientific paper
2000-09-29
Mathematics
Probability
9 page extended abstract, will appear proc. of 41st Annual Symposium on Foundations of Computer Science. See http://www.mts.jh
Scientific paper
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples from these distributions. The primary drawback to traditional Markov chain methods is that the mixing time of the chain is usually unknown, which makes it impossible to determine how close the output samples are to having the target distribution. Here we present a new protocol, the randomness recycler (RR), that overcomes this difficulty. Unlike classical Markov chain approaches, an RR-based algorithm creates samples drawn exactly from the desired distribution. Other perfect sampling methods such as coupling from the past use existing Markov chains, but RR does not use the traditional Markov chain at all. While by no means universally useful, RR does apply to a wide variety of problems. In restricted instances of certain problems, it gives the first expected linear time algorithms for generating samples. Here we apply RR to self-organizing lists, the Ising model, random independent sets, random colorings, and the random cluster model.
Fill James Allen
Huber Mark L.
No associations
LandOfFree
The Randomness Recycler: A new technique for perfect sampling 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 Randomness Recycler: A new technique for perfect sampling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Randomness Recycler: A new technique for perfect sampling will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-343236