Stein's method, Jack measure, and the Metropolis algorithm

Journal of Combinatorial Theory. Series A

Volumn 108, Issue 2, 2004, Pages 275-296

  Fulman, Jason ^a  

^a UNIVERSITY OF PITTSBURGH   (United States)

Author keywords

Central limit theorem; Jack polynomial; Plancherel measure; Spherical function; Stein's method

Indexed keywords

EID: 9144230885     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jcta.2004.07.003     Document Type: Article

References (34)

1. D. Aldous P. Diaconis Longest increasing subsequences from patience sorting to the Baik-Deift-Johansson theorem Bull. Amer. Math. Soc. (N.S.) 36 1999 413-432
2. R. Arratia L. Goldstein L. Gordon Poisson approximation and the Chen-Stein method Statist. Sci. 5 1990 403-434
3. A.D. Barbour L. Holst S. Janson Poisson Approximation 1992 Oxford Science Publications, Clarendon Press, Oxford University Press New York
4. A. Borodin, G. Olshanski, Z -measures on partitions and their scaling limits, preprint math-ph/0210048 at http://xxx.lanl.gov.
5. A. Borodin G. Olshanski Harmonic functions on multiplicative graphs and interpolation polynomials Electron. J. Combin. 7 2000 39 Research paper 28, electronic
6. A. Borodin A. Okounkov G. Olshanski Asymptotics of Plancherel measure for symmetric groups J. Amer. Math. Soc. 13 2000 481-515
7. 2 approximation and spectral measure of Gelfand pairs, in preparation.
8. P. Deift Integrable systems and combinatorial theory Notices Amer. Math. Soc. 47 2000 631-640
9. P. Diaconis, P. Hanlon, Eigen-analysis for some examples of the Metropolis algorithm, in Hypergeometric functions on domains of positivity, Jack polynomials and applications, Contemp. Math. vol. 138, Amer. Math. Soc., Providence, RI, 1992, pp. 99-117.
10. P. Diaconis S. Holmes Random walks on trees and matchings Elec. J. Probab. 7 2002 17 electronic
11. P. Diaconis L. Saloff-Coste What do we know about the Metropolis algorithm? J. Comput. System Sci. 57 1998 20-36
12. P. Diaconis M. Shahshahani Generating a random permutation with random transpositions Z. Wahr. Verw. Gebiete 57 1981 159-179
13. A. Eskin A. Okounkov Asymptotics of branched coverings of a torus and volumes of moduli spaces of holomorphic differentials Invent. Math. 145 2001 59-103
14. F. Frobenuis, Uber die charaktere der symmetrischen gruppe, Sitz. Konig. Preuss. Akad. Wissen., 1900, pp. 516-534
15. F. Frobenuis, Gesammelte abhandlungen III, Springer, Heidelberg, 1968, pp. 148-166.
16. J. Fulman, Stein's method and Plancherel measure of the symmetric group, Trans. Amer. Math., Soc. to appear, available at http://www.math.pitt.edu/~fulman.
17. J. Fulman, Card shuffling and the decomposition of tensor products, Pacific J. Math., to appear available at http://www.math.pitt.edu/ ~fulman.
18. J. Fulman, Martingales and character ratios, preprint math.RT/0402409 at http://xxx.lanl.gov.
19. J. Fulman, Stein's method and non-reversible Markov chains, Proceedings of 1998 Conference on Stein's Method and Monte Carlo Markov Chains, to appear.
20. P. Hanlon A Markov chain on the symmetric group and Jack symmetric functions Discrete Math. 99 1992 123-140
21. A. Hora Central limit theorem for the adjacency operators on the infinite symmetric group Comm. Math. Phys. 195 1998 405-416
22. V. Ivanov G. Olshanski Kerov's central limit theorem for the Plancherel measure on Young diagrams Symmetric Functions 2001 Surveys of Developments and Perspectives 2002 Kluwer Academic Publishers Dordrecht
23. K. Johansson Discrete orthogonal polynomial ensembles and the Plancherel measure Ann. Math. ( 2) 153 2001 259-296
24. S.V. Kerov Gaussian limit for the Plancherel measure of the symmetric group C. R. Acad. Sci. Paris, Serie I 316 1993 303-308
25. S.V. Kerov The boundary of Young lattice and random Young tableaux L. Billera C. Greene R. Simion R. Stanley Stanley Formal Power Series and Algebraic Combinatorics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 24 1996 American Mathematical Society Providence, RI 133-158
26. S.V. Kerov Anisotropic Young diagrams and Jack symmetric functions Funct. Anal. Appl. 34 2000 41-51
27. I. Macdonald Symmetric Functions and Hall Polynomials second ed. 1995 Oxford University Press New York
28. N. Metropolis A. Rosenbluth M. Rosenbluth A. Teller E. Teller Equations of state calculations by fast computing machines J. Chem. Phys. 21 1953 1087-1092
29. A. Okounkov Random matrices and random permutations Internat. Math. Res. Notices 20 2000 1043-1095
30. A. Okounkov, The uses of random partitions, preprint math-ph/0309015 at http://xxx.lanl.gov.
31. Y. Rinott V. Rotar On coupling constructions and rates in the CLT for dependent summands with applications to the antivoter model and weighted U -statistics Ann. Appl. Probab. 7 1997 1080-1105
32. R. Stanley Some combinatorial properties of Jack symmetric functions Adv. Math. 77 1989 76-115
33. C. Stein, Approximate Computation of Expectations, Institute of Mathematical Statistics Lecture Notes, vol. 7, 1986.
34. C. Stein, A way of using auxiliary randomization. Probability theory (Singapore, 1989), 1992, pp. 159-180.