Extension of Fill's perfect rejection sampling algorithm to general chains

Details Extension of Fill's perfect rejection sampling algorithm to general chains Extension of Fill's perfect rejection sampling algorithm to general chains

2001-05-30

arxiv.org/abs/math/0105252v1

Random Structures Algorithms 17 (2000) 290-316

Mathematics

Probability

See also http://www.mts.jhu.edu/~fill/ and http://www.math.usu.edu/~machida/

Scientific paper

By developing and applying a broad framework for rejection sampling using auxiliary randomness, we provide an extension of the perfect sampling algorithm of Fill (1998) to general chains on quite general state spaces, and describe how use of bounding processes can ease computational burden. Along the way, we unearth a simple connection between the Coupling From The Past (CFTP) algorithm originated by Propp and Wilson (1996) and our extension of Fill's algorithm.

Affiliated with

Also associated with

No associations

Rating

Extension of Fill's perfect rejection sampling algorithm to general 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 Extension of Fill's perfect rejection sampling algorithm to general chains, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extension of Fill's perfect rejection sampling algorithm to general chains will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-250254