Mathematics – Probability
Scientific paper
2002-05-14
Mathematics
Probability
19 pages. See also http://www.mts.jhu.edu/~fill/ and http://www.mathcs.carleton.edu/faculty/bdobrow/. Submitted for publicatio
Scientific paper
In a previous paper by the second author,two Markov chain Monte Carlo perfect sampling algorithms -- one called coupling from the past (CFTP) and the other (FMMR) based on rejection sampling -- are compared using as a case study the move-to-front (MTF) self-organizing list chain. Here we revisit that case study and, in particular, exploit the dependence of FMMR on the user-chosen initial state. We give a stochastic monotonicity result for the running time of FMMR applied to MTF and thus identify the initial state that gives the stochastically smallest running time; by contrast, the initial state used in the previous study gives the stochastically largest running time. By changing from worst choice to best choice of initial state we achieve remarkable speedup of FMMR for MTF; for example, we reduce the running time (as measured in Markov chain steps) from exponential in the length n of the list nearly down to n when the items in the list are requested according to a geometric distribution. For this same example, the running time for CFTP grows exponentially in n.
Dobrow Robert P.
Fill James Allen
No associations
LandOfFree
Speeding up the FMMR perfect sampling algorithm: A case study revisited 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 Speeding up the FMMR perfect sampling algorithm: A case study revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Speeding up the FMMR perfect sampling algorithm: A case study revisited will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-489507