41 citations · 167 across the 47 of their papers we have counts for
Showing 2002 · math.PRShow all
2 papers · 2 filters
math.PR2002
Speeding up the FMMR perfect sampling algorithm: A case study revisited
Robert P. Dobrow, James Allen Fill
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 rejectio…
math.PR2002
Interruptible exact sampling in the passive case
Keith Crank, James Allen Fill
We establish, for various scenarios, whether or not interruptible exact stationary sampling is possible when a finite-state Markov chain can only be viewed passively. In particular…