Analysis of systematic scan metropolis algorithms using Iwahori-Hecke algebra techniques

Michigan Mathematical Journal

Volumn 48, Issue SUPPL., 2000, Pages 157-190

  Diaconis, Persi ^a   Arun, Ram ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF WISCONSIN MADISON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040780247     PISSN: 00262285     EISSN: None     Source Type: Journal    
DOI: 10.1307/mmj/1030132713     Document Type: Article

References (44)

1. Y. Amit, Convergence properties of the Gibbs sampler for perturbations of Gaussians, Ann. Statist. 24 (1996), 122-140.
2. _, On rates of convergence of stochastic relaxation for Gaussian and non-Gaussian distributions, J. Multivariate Anal. 38 (1991), 82-99.
3. Y. Amit and U. Grenander, Comparing sweep strategies for stochastic relaxation, J. Multivariate Anal. 37 (1991), 197-222.
4. n and construction of its irreducible representations, Adv. Math. 106 (1994), 216-243.
5. P. Barone and A. Frigessi, Improving stochastic relaxation for Gaussian random fields, Probab. Engrg. Inform. Sci. 4 (1990), 369-389.
6. E. Belsley, Rates of convergence of random walk on distance regular graphs, Probab. Theory Related Fields 112 (1998), 493-533.
7. _, Rates of convergence of Markov chains related to association schemes, Ph.D. dissertation, Harvard Univ., Cambridge, MA, 1993.
8. L. Billera, S. Holmes, and K. Vogtman, Geometry of the space of phylogenetic trees, technical report, Stanford Univ., Stanford, CA, 1999.
9. N. Bourbaki, Elements de mathematique. Groupes et algèbres de Lie, Masson, Paris, 1981.
10. E. Brieskorn and K. Saito, Artin-Gruppen und Coxeter-Gruppen, Invent. Math. 17 (1972), 245-271.
11. K. S. Brown, Buildings, Springer-Verlag, New York, 1989.
12. R. Carter, Finite groups of Lie type, Pure Appl. Math., Wiley, New York, 1985.
13. D. E. Critchlow, Metric methods for analyzing partially ranked data, Lecture Notes in Statist., 34, Springer-Verlag, Berlin, 1985.
14. C. W. Curtis and I. Reiner, Methods of representation theory, vols. I and II, Wiley, New York, 1981 and 1987.
15. P. Deligne, Les immeubles des groupes de tresses généralisés, Invent. Math. 17 (1972), 273-302.
16. P. Diaconis, Group representations in probability and statistics, Institute of Mathematical Statistics, Hayward, CA, 1988.
17. P. Diaconis and P. Hanlon, Eigen-analysis for some examples of the Metropolis algorithm, Contemp. Math., 138, pp. 99-117, Amer. Math. Soc., Providence, RI, 1992.
18. P. Diaconis, S. Holmes, S. Janson, S. P. Lalley, and R. Pemantle, Metrics on compositions and coincidences among renewal sequences, IMA Vol. Math. Appl., 76, Springer, New York, 1996.
19. P. Diaconis and A. Ram, Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques, technical report, Stanford Univ., Stanford, CA, 2000.
20. P. Diaconis and L. Saloff-Coste, What do we know about the Metropolis algorithm?, J. Comput. System Sci. 57 (1998), 20-36.
21. W. Feller, An introduction to probability theory and its applications, vol. I, Wiley, New York, 1968.
22. M. A. Figner and J. S. Verducci, Probability models and statistical analyses for ranking data, Springer-Verlag, New York, 1992.
23. [Fi] G. S. Fishman, Coordinate selection rules for Gibbs sampling, Ann. Appl. Probab. 6 (1996), 444-465.
24. W. Fulton, Young tableaux, London Math. Soc. Stud. Texts, 35, Cambridge Univ. Press, Cambridge, U.K., 1997.
25. J. Goodman and A. Sokal, Multigrid Monte-Carlo method, Phys. Rev. D 40 (1989), 2035-2071.
26. J. Hammersley and D. Handscomb, Monte Carlo methods, Methune, London, 1965.
27. P. N. Hoefsmit, Representations of Hecke algebras of finite groups with BN-pairs of classical type, Ph.D. dissertation, Univ. of British Columbia, Vancouver, BC, 1974.
28. J. E. Humphreys, Reflection groups and Coxeter groups, Cambridge Univ. Press, Cambridge, U.K., 1990.
29. J. G. Kemeny and J. L. Snell, Finite Markov chains, Van Nostrand, New York, 1960.
30. R. Kilmoyer and L. Solomon, On the theorem of Feil-Higman, J. Combin. Theory Ser. A 15 (1973), 310-322.
31. G. Letac, Problèmes classiques de probabilité sur un couple de Gelfand, Lecture Notes in Math., 861, Springer-Verlag, New York, 1981.
32. _, Les fonctions sphériques d'un couple de Gelfand symétrique et les chaînes de Markov, Adv. in Appl. Probab. 14 (1982), 272-294.
33. I. G. Macdonald, Symmetric functions and Hall polynomials, Oxford Math. Monogr., Oxford Univ. Press, New York, 1995.
34. C. L. Mallows, Non-null ranking models. I, Biometrika 44 (1957), 114-130.
35. J. I. Marden, Analyzing and modeling rank data, Monogr. Statist. Appl. Probab., 64, Chapman & Hall, London, 1995.
36. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller, Equations of state calculations by fast computing machines, J. Chem. Phys. 21 (1953), 1087-1092.
37. I. M. Pak, When and how n choose k, Ser. Discrete Math. Theoret. Comput. Sci., 43, pp. 191-238, Amer. Math. Soc., Providence, RI, 1999.
38. A. Ram, Seminormal representations of Weyl groups and Iwahori-Hecke algebras, Proc. London Math. Soc. (3) 75 (1997), 99-133
39. G. Roberts and S. Sahu, Updating schemes, correlation schemes, correlation structure, blocking and parameterization for the Gibbs sampler, J. Roy. Statist. Soc. B 59 (1997), 291-318.
40. K. Ross and D. Xu, Hypergroup deformations and Markov chains, J. Theoret. Probab. 7 (1994), 813-830.
41. L. Saloff-Coste, Lectures on probability theory and statistics, Lecture Notes in Math., 1665, pp. 301-413, Springer-Verlag, Berlin, 1997.
42. C. Schoolfield, Random walks on wreath products of groups and Markov chains on related homogeneous spaces, Ph.D. dissertation, Johns Hopkins Univ., Baltimore, MD, 1998.
43. W. Shannon and D. Banks, Combining classification trees using MLE, Statist. in Medicine 18 (1999), 727-740.
44. J. Silver, Weighted Poincaré and exhaustive approximation techniques for scaled Metropolis-Hastings and spectral total variation convergence bounds in infinite commutable Markov chain theory, Ph.D. dissertation, Harvard Univ., Cambridge, MA, 1996.