Efficient use of exact samples

Statistics and Computing

Volumn 10, Issue 3, 2000, Pages 237-243

  Murdoch, Duncan J ^a   Rosenthal, Jeffrey S ^b  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Coupling from the past; Exact sampling; Perfect sampling; Regeneration; Tours

Indexed keywords

EID: 0042727441     PISSN: 09603174     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008991527785     Document Type: Article

References (19)

1. Asmussen S. 1987. Applied Probability and Queues. New York, John Wiley & Sons.
2. Fill J.A. 1998. An interruptible algorithm for perfect sampling via Markov chains. Annals of Applied Probability 8: 131-162.
3. Fill J.A., Machida M., Murdoch D.J., and Rosenthal J.S. 2000. Extension of Fill's perfect rejection sampling algorithm to general chains. Random Structures and Algorithms 16, to appear.
4. Gelfand A.E., Hills S.E., Racine-Poon A., and Smith A.F.M. 1990. Illustration of Bayesian inference in normal data models using Gibbs sampling. Journal of the American Statistical Association 85: 972-985.
5. Gelfand A.E. and Smith A.F.M. 1990. Sampling-based approaches to calculating marginal densities. Journal of the American Statistical Association 85: 398-409.
6. Gilks W.R. 1996. Full conditional distributions. In: Gilks W.R., Richardson S., and Spiegelhalter D.J. (Eds.), Markov Chain Monte Carlo in Practice. Chapman and Hall, pp. 75-88.
7. Green P.J. and Murdoch D.J. 1999. Exact sampling for Bayesian inference: towards general purpose algorithms (with discussion). In: Bayesian Statistics 6, Bernardo U.M., Berger J.O., Dawid A.P., and Adrian Smith P.M. (Eds.), Oxford University Press, pp. 301-321.
8. Häggström O., Lieshout M.N.M., and Møller J. 1996. Characterisation results and Markov chain Monte Carlo algorithms including exact simulation for some spatial point processes. Technical Report R-96-2040, Department of Mathematics, Aalborg University. To appear in Bernoulli.
9. Kendall W.S. 1997. On some weighted Boolean models. In: Jeulin, D. (Ed.), Advances in Theory and Applications of Random Sets. Singapore, World Scientific Publishing Company, pp. 105-120.
10. Kendall W. 1998. Perfect simulation for the area-interaction point process. In: Accardi L. and Heyde C.C. (Eds.), Probability Towards 2000. New York, Springer.
11. Meyn S.P. and Tweedie R.L. 1994. Computable bounds for convergence rates of Markov chains. Annals of Applied Probability 4: 981-1011.
12. Møller J. 1997. Perfect simulation of conditionally specified models. Technical Report R-97-2006, Department of Mathematics, Aalborg University. To appear in J. Roy. Stat. Soc., Ser. B.
13. Murdoch D.J. and Green P.J. 1997. Exact sampling from a continuous state space. Scandinavian Journal of Statistics 25: 483-502.
14. Mykland P., Tierney L., and Yu B. 1995. Regeneration in Markov chain samplers. Journal of the American Statistical Association 90:233-241.
15. Propp J.G. and Wilson D.B. 1996. Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms 9: 223-252.
16. Propp J.G. and Wilson D.B. 1998. How to get a perfectly random sample from a generic Markov chain and generate a random spanning tree of a directed graph. Journal of Algorithms 27: 170-217.
17. Rosenthal J.S. 1995. Minorization conditions and convergence rates for Markov chain Monte Carlo. Journal of the American Statistical Association 90: 558-566.
18. Smith A.F.M. and Roberts G.O. 1993. Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods (with discussion). Journal of the Royal Statistical Association, Series B 55: 3-24.
19. Tierney L. 1994. Markov chains for exploring posterior distributions (with discussion). Annals of Statistics 22: 1701-1762.