Covariance ordering for discrete and continuous time Markov chains

Statistica Sinica

Volumn 19, Issue 2, 2009, Pages 651-666

  Mira, Antonietta ^a   Leisen, Fabrizio ^b  

^a UNIVERSITY OF INSUBRIA   (Italy)

^b UNIVERSITY OF NAVARRA   (Spain)

Author keywords

Asymptotic variance; Efficiency ordering; MCMC; Timeinvariance estimating equations

Indexed keywords

EID: 68149141555     PISSN: 10170405     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (24)

1. Baddeley, A. J. (2000). Time-invariance estimating equations. Bernoulli 6, 783-808.
2. Bhattacharya, R. (1982). On the functional central limit theorem and the law of the iterated logarithm for Markov processes. Z. Wahrsch. Verm. Gebiete 60, 185-201.
3. Bremaud, P. (1998). Markov Chains. Springer Verlag, New York.
4. Chan, K. S. and Geyer, C. (1994). Discussion of the paper of Tierney: Markov chains for exploring posterior distributions. Ann. Statist. 22, 1747-1758.
5. Conway, J. B. (1985). A course in Functionals Analysis. Springer Verlag.
6. Dunford, N. and Schwartz, J. (1963). Linear Operator Part II. First edition. John Wiley and Sons, New York.
7. Pristed, B. and Gray, L. (1997). A Modern Approach to Probability Theory, Birkhauser, Boston.
8. Gordin, M. I. and Lifsic, B. A. (1978). The central limit theorem for stationary Markov processes. Soviet Mathematics Doklady 19, 392-394.
9. Hobert, J. P. and Marchev, D. (2008). A theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms. Ann. Statist. 32, 532-554.
10. Kipnis, C. and Varadhan, S. R. S. (1986). Central limit theorem for additive functionals of reversible Markov processes and applications to simple exclusions. Commun. Math. Phys. 104, 1-19.
11. Kemeny, J. G. and Snell, J. L. (1969). Finite Markov Chain. Princeton: Van Nostrand.
12. Koranyi, A. (1956). On a theorem by Lowner and its connections with resolvents of selfadjoint transformations. Acta Scientiarum Mathematicarum 7, 63-70.
13. Leisen, F. and Mira, A. (2008). An extension of Peskun and Tierney orderings to continuous time Markov chains. Statist. Sinica 18, 1641-1651.
14. Liu, J. S. and Wu, Y. N. (1999). Parameter expansion for data augmentation. J. Amer. Statist. Assoc. 94, 1264-1274.
15. Löwner, K. (1934). Über monotone matrixfunktionen. Mathematische Zeitschrift 38, 177-216.
16. Meng, X. L. and van Dyk, D. A. (1999). Seeking efficient data augmentation schemes via conditional and marginal augmentation. Biometrika 86, 301-320.
17. Mira, A. (2001). Ordering and Improving MCMC performances. Statist. Sci. 16, 340-350.
18. Mira, A. and Geyer, C. J. (1999). Ordering Monte Carlo Markov Chains. School of Statistics University of Minnesota, Technical Report 632.
19. Mira, A. and Baddeley, A. (2001). Performance of time-invariance estimators. Department of Mathematics and Statistics, University of Western Australia (Perth, Australia), Technical Report 15.
20. Peskun, P. H. (1973). Optimum Monte Carlo sampling using Markov Chains. Biometrika 60, 607-612.
21. Roberts, G. O. and Rosenthal, J. S. (1997). Geometric ergodicity and hybrid Markov chains. Electronic Communications in Probability 2, 13-25.
22. Tanner, M. A. and Wong, W. H. (1987). The calculation of posterior distributions by data augmentation (with discussion). J. Amer. Statist. Assoc. 82, 528-550.
23. Tierney, L. (1994). Markov chains for exploring posterior distributions. Ann. Statist. 22, 1701-1762.
24. Tierney, L. (1998). A note on Metropolis Hastings kernels for general state spaces. Ann. Appl. Probab. 8, 1-9.