Geometric ergodicity and perfect simulation

Electronic Communications in Probability

Volumn 9, Issue , 2004, Pages 140-151

  Kendall, Wilfrid S ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

CFTP; Domcftp; Geometric ergodicity; Geometric Foster Lyapunov condition; Markov chain Monte Carlo; Perfect simulation; Uniform ergodicity

Indexed keywords

EID: 9744225015     PISSN: None     EISSN: 1083589X     Source Type: Journal    
DOI: 10.1214/ECP.v9-1117     Document Type: Article

References (21)

1. Burdzy, K. and W. S. Kendall [2000, May]. Efficient Markovian couplings: examples and counterexamples. The Annals of Applied Probability 10(2), 362-409.
2. Cai, Y. and W. S. Kendall [2002, July]. Perfect simulation for correlated Poisson random variables conditioned to be positive. Statistics and Computing 12, 229-243.
3. Corcoran, J. N. and R. L. Tweedie [2001]. Perfect sampling of ergodic Harris chains. The Annals of Applied Probability 11(2), 438-451.
4. Foss, S. G. and R. L. Tweedie [1998]. Perfect simulation and backward coupling. Stochastic Models 14, 187-203.
5. Goldstein, S. [1978/1979]. Maximal coupling. Zeitschrift fur Wahrscheinlichkeitstheorie und Verve Gebiete 46(2), 193-204.
6. Griffeath, D. [1974/1975]. A maximal coupling for Markov chains. Zeitschrift fur Wahrscheinlichkeitstheorie und Verve Gebiete 31, 95-106.
7. Grimmett, G. R. and D. R. Stirzaker [1992]. Probability and random processes (Second ed.). New York: The Clarendon Press Oxford University Press.
8. Hayes, T. and E. Vigoda [2003]. A non-Markovian coupling for randomly sampling colorings. Preprint, University of Chicago Department of Computer Science., PDF file available.
9. Hobert, J. P. and C. P. Robert [2004]. A mixture representation of w with applications in Markov chain Monte Carlo and perfect sampling. The Annals of Applied Probability 14(3), 1295-1305.
10. Huber, M. [2004, March]. Time dependent update functions for perfect sampling. Conference presentation at IMS meeting on Monte Carlo Markov chain methods in Singapore, Department of Mathematics, Duke University.
11. Kendall, W. S. [1998]. Perfect simulation for the area-interaction point process. In L. Accardi and C. C. Heyde (Eds.), Probability Towards 2000, New York, pp. 218-234. SpringerVerlag.
12. Kendall, W. S. and J. Mpller [2000, September]. Perfect simulation using dominating processes on ordered state spaces, with application to locally stable point processes. Advances in Applied Probability 32(3), 844-865.
13. Meyn, S. P. and R. L. Tweedie [1993]. Markov Chains and Stochastic Stability. New York: Springer-Verlag.
14. Murdoch, D. J. and P. J. Green [1998]. Exact sampling from a continuous state space. Scandinavian Journal of Statistics Theory and Applications 25, 483-502.
15. Nummelin, E. [1978]. A splitting technique for Harris-recurrent chains. Zeitschrift fur Wahrscheinlichkeitstheorie und Verve Gebiete J5, 309-318.
16. Propp, J. G. and D. B. Wilson [1996]. Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Structures and Algorithms 9, 223-252.
17. Roberts, G. O. and J. S. Rosenthal [2001]. Small and pseudo-small sets for Markov chains. Stochastic Models 17(2), 121-145.
18. Roberts, G. O. and J. S. Rosenthal [2002]. One-shot coupling for certain stochastic recursive sequences. Stochastic Processes and Their Applications 99(2), 195-208.
19. Rosenthal, J. S. [2002]. Quantitative convergence rates of Markov chains: A simple account. Electronic Communications in Probability 7, no. 13, 123-128 (electronic).
20. Wilson, D. B. [2000a]. How to couple from the past using a read-once source of randomness. Random Structures and Algorithms 16(1), 85-113.
21. Wilson, D. B. [2000b]. Layered Multishift Coupling for use in Perfect Sampling Algorithms (with a primer on CFTP). In N. Madras (Ed.), Monte Carlo Methods, Volume 26 of Fields Institute Communications, pp. 143-179. American Mathematical Society.