Bayesian analysis for reversible markov chains

Annals of Statistics

Volumn 34, Issue 3, 2006, Pages 1270-1292

  Diaconis, Persi ^a   Rolles, Silke W W ^b  

^a STANFORD UNIVERSITY   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Bayesian analysis; Conjugate priors; Hypothesis testing; Reversible Markov chains

Indexed keywords

EID: 33746180663     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/009053606000000290     Document Type: Article

References (19)

1. CHAN, C. S., ROBBINS, D. P. and YUEN, D. S. (2000). On the volume of a certain polytope. Experiment. Math. 9 91-99. MR1758803
2. DALAL, S. R. and HALL, W. J. (1983). Approximating priors by mixtures of natural conjugate priors. J. Roy. Statist. Soc. Ser. B 45 278-286. MR0721753
3. DIACONIS, P. (1988). Recent progress on de Finetti's notions of exchangeability. In Bayesian Statistics 3 (J.-M. Bernardo, M. H. DeGroot, D. V. Lindley and A. F. M. Smith, eds.) 111-125. Oxford Univ. Press, New York. MR1008047
4. DIACONIS, P. and FREEDMAN, D. (1980). de Finetti's theorem for Markov chains. Ann. Probab. 8 115-130. MR0556418
5. DIACONIS, P. and YLVISAKER, D. (1985). Quantifying prior opinion (with discussion). In Bayesian Statistics 2 (J.-M. Bernardo, M. H. DeGroot, D. V. Lindley and A. F. M. Smith, eds.) 133-156. North-Holland, Amsterdam. MR0862488
6. FORTINI, S., LADELLI, L., PETRIS, G. and REGAZZINI, E. (2002). On mixtures of distributions of Markov chains. Stochastic Process. Appl. 100 147-165. MR1919611
7. FREEDMAN, D. A. (1962). Mixtures of Markov processes. Ann. Math. Statist. 33 114-118. MR0137156
8. GIBLIN, P. J. (1981). Graphs, Surfaces and Homology. An Introduction to Algebraic Topology, 2nd ed. Chapman and Hall, London. MR0643363
9. GOOD, I. J. (1968). The Estimation of Probabilities. An Essay on Modern Bayesian Methods. MIT Press, Cambridge, MA. MR0245135
10. GOOD, I. J. and CROOK, J. F. (1987). The robustness and sensitivity of the mixed-Dirichlet Bayesian test for "independence" in contingency tables. Ann. Statist. 15 670-693. MR0888433
11. HÖGLUND, T. (1974). Central limit theorems and statistical inference for finite Markov chains. Z. Wahrsch. Verw. Gebiete 29 123-151. MR0373201
12. KEANE, M. S. (1990). Solution to problem 288. Statist. Neerlandica 44 95-100.
13. KEANE, M. S. and ROLLES, S. W. W. (2000). Edge-reinforced random walk on finite graphs. In Infinite Dimensional Stochastic Analysis (Ph. Clément, F. den Hollander, J. van Neerven and B. de Pagter, eds.) 217-234. R. Neth. Acad. Arts Sci., Amsterdam. MR1832379
14. MAURER, S. B. (1976). Matrix generalizations of some theorems on trees, cycles and cocycles in graphs. SIAM J. Appl. Math. 30 143-148. MR0392635
15. PEMANTLE, R. (1988). Phase transition in reinforced random walk and RWRE on trees. Ann. Probab. 16 1229-1241. MR0942765
16. ROLLES, S. W. W. (2003). How edge-reinforced random walk arises naturally. Probab. Theory Related Fields 126 243-260. MR 1990056
17. STANLEY, R. P. (1978). Generating functions. In Studies in Combinatorics (G.-C. Rota, ed.) 100-141. Math. Assoc. Amen, Washington. MR0513004
18. ZABELL, S. L. (1982). W. E. Johnson's "sufficientness" postulate. Ann. Statist. 10 1090-1099. MR0673645
19. ZABELL, S. L. (1995). Characterizing Markov exchangeable sequences. J. Theoret. Probab. 8 175-178. MR1308676