Mathematics – Probability
Scientific paper
2004-05-14
Annals of Applied Probability 2004, Vol. 14, No. 2, 734-753
Mathematics
Probability
Scientific paper
10.1214/105051604000000080
Bounding chains are a technique that offers three benefits to Markov chain practitioners: a theoretical bound on the mixing time of the chain under restricted conditions, experimental bounds on the mixing time of the chain that are provably accurate and construction of perfect sampling algorithms when used in conjunction with protocols such as coupling from the past. Perfect sampling algorithms generate variates exactly from the target distribution without the need to know the mixing time of a Markov chain at all. We present here the basic theory and use of bounding chains for several chains from the literature, analyzing the running time when possible. We present bounding chains for the transposition chain on permutations, the hard core gas model, proper colorings of a graph, the antiferromagnetic Potts model and sink free orientations of a graph.
No associations
LandOfFree
Perfect Sampling Using Bounding Chains 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 Perfect Sampling Using Bounding Chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Perfect Sampling Using Bounding Chains will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-671768