Random walks on trees and matchings

Electronic Journal of Probability

Volumn 7, Issue , 2002, Pages 1-17

  Diaconis, Persi ^a   Holmes, Susan P ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

Coagulation Fragmentation; Fourier analysis; Markov Chain; Matchings; Phylogenetic Tree; Zonal polynomials

Indexed keywords

EID: 0347556742     PISSN: None     EISSN: 10836489     Source Type: Journal    
DOI: 10.1214/EJP.v7-105     Document Type: Article

References (40)

1. Aldous, D. J. (1996). Probability Distributions on Cladograms, pages 1-18. in Random discrete structures (Aldous and Pemantle, eds.) Number 76 in IMA Series. Springer Verlag, NY.
2. Aldous, D. J. (1998). Stochastic coalescence. In Proceedings of the International Congress of Mathematicians, Vol. III (Berlin, 1998), number Extra Vol. III, pages 205-211 (electronic).
3. Aldous, D. J. (1999). Deterministic and stochastic models for coalescence (aggregation and coagulation): a review of the mean-field theory for probabilists. Bernoulli 5, 3-48.
4. Aldous, D. J. (2000). Mixing time for a Markov chain on Cladograms. Combin. Probab. Computing 9, 191-204.
5. Aldous, D. J. (2001). Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today. Statist. Sci. 16, 23-34.
6. Aldous, D. J. & Fill, J. (2002). Reversible Markov chains and random walks on graphs. URL= http://www.mts.jhu.edu/∼fill.
7. Barbour, A. D., Holst, L., & Janson, S. (1992). Poisson approximation. The Clarendon Press Oxford University Press, New York. Oxford Science Publications.
8. Diaconis, P. (1988). Group Representations in Probability and Statistics. Institute of Mathematical Statistics, Hayward, Calif.
9. Diaconis, P. & Hanlon, P. (1992). Eigen-analysis for some examples of the Metropolis algorithm. In Hypergeometric functions on domains of positivity, Jack polynomials, and applications (Tampa, FL, 1991), pages 99-117. Amer. Math. Soc., Providence, RI.
10. Diaconis, P. W. & Holmes, S. P. (1998). Matchings and phylogenetic trees. Proc. Natl. Acad. Sci. USA 95, 14600-14602 (electronic).
11. Diaconis, P. & Ram, A. (2000). Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques. Michigan Math. Journ. 48, 157-190.
12. Diaconis, P. & Saloff-Coste, L. (1993a). Comparison techniques for random walk on finite groups. Ann. Probab. 21, 2131-2156.
13. Diaconis, P. & Saloff-Coste, L. (1993b). Comparison theorems for reversible Markov chains. Ann. Appl. Probab. 3, 696-730.
14. Diaconis, P. & Shahshahani, M. (1981). Generating a random permutation with random transpositions. Z. W. 57, 159-179.
15. Diaconis, P. & Shahshahani, M. (1987). Time to reach stationarity in the Bernoulli-Laplace diffusion model. SIAM J. Math. Anal. 18, 208-218.
16. Durrett, R., Granovsky, B. L., & Gueron, S. (1999). The equilibrium behavior of reversible coagulation-fragmentation processes. J. Theoret. Probab. 12, 447-474.
17. Ewens, W. J. (1972). The sampling theory of selectively neutral alleles. Theoretical Population Biology 3, 87-112.
18. Hammersley, J. M. & Handscomb, D. C. (1964). Monte Carlo Methods. Chapman and Hall, London.
19. Holmes, S. (1999). Phylogenies: An overview. In Halloran, E. & Geisser, S., editors, Statistics and Genetics, number 81 in IMA. Springer Verlag, NY.
20. n. Arch. Math. (Basel) 54, 258-259.
21. Ingram, R. E. (1950). Some characters of the symmetric group. Proc. Amer. Math. Soc. 1, 358-369.
22. James, G. & Kerber, A. (1981). The representation theory of the symmetric group. Addison-Wesley, Reading, MA.
23. James, A. T. (1968). Calculation of zonal polynomial coefficients by use of the Laplace-Beltrami operator. Ann. Math. Statist 39, 1711-1718.
24. James, A. T. (1982). Analysis of variance determined by symmetry and combinatorial properties of zonal polynomials. In Statistics and probability: essays in honor of C. R. Rao, pages 329-341. North-Holland, Amsterdam.
25. Jerrum, M. & Sinclair, A. (1989). Approximating the permanent. SIAM Journal on Computing 18, 1149-1178.
26. Jerrum, M., Sinclair, A., & Vigoda, E. (2000). A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. Electronic Colloquium on Computational Complexity (ECCC).
27. Lovasz, L. & Plummer, M. D. (1985). Matching Theory. North Holland, Amsterdam.
28. Macdonald, I. G. (1995). Symmetric functions and Hall polynomials. The Clarendon Press Oxford University Press, New York, second edition. With contributions by A. Zelevinsky, Oxford Science Publications.
29. Mayer-Wolfe, E., Zeitouni, O., & Zerner, M. (2001). Asymptotics of certain coagulation-fragmentation processes and invariant Poisson-Dirichlet measures. Technical report, Dept. of Mathematics, Stanford University, Stanford, CA94305.
30. Page, R. & Holmes, E. (2000). Molecular Evolution, A Phylogenetic Approach. Blackwell Science.
31. Pulleyblank, W. (1995). Matchings and extensions. In Graham, R. L., Grotschel, M., & Lovasz, L., editors, Handbook of combinatorics. Vol. 1, 2, pages Vol. I: cii+1018 pp.; Vol. II: pp. i-cii and 1019-2198, Amsterdam. Elsevier Science B.V.
32. Roussel, S. (2000). Phenomene de cutoff pour certaines marches aléatoires sur le groupe symetrique. Colloq. Math. 86, 111-135.
33. Sagan, B. E. (2001). The symmetric group. Springer-Verlag, New York, second edition. Representations, combinatorial algorithms, and symmetric functions.
34. Saloff-Coste, L. (1997). Lectures on finite Markov chains. In Lectures on probability theory and statistics, pages 301-413, Berlin. Lecture Notes in Math., 1665, Springer-Verlag. Lectures from the 26th Summer School on Probability Theory held in Saint-Flour,Edited by P. Bernard.
35. Saxl, J. (1981). On multiplicity-free permutation representations. In Finite geometries and designs (Proc. Conf., Chelwood Gate, 1980), pages 337-353. Cambridge Univ. Press, Cambridge.
36. Soarabotti, F. (1997). Time to reach stationarity in the Bernoulli-Laplace diffusion model with many urns. Adv. Math. 18, 351-371.
37. Sohröder, E. (1870). Veir combinatorische probleme. Zeit. für. Math. Phys. 15, 361-376.
38. 2) bound for the relaxation time of a Markov chain on cladograms. Technical Report 572, Dept Statistics, UC Berkeley.
39. Serre, J.-P. (1977). Linear representations of finite groups. Springer-Verlag, New York. Translated from the second French edition by Leonard L. Scott, Graduate Texts in Mathematics, Vol. 42.
40. Wachs, M. (2001). Topology of matching, homology of matching, combinatorial Laplacian of the matching complex. URL http://www.math.miami.edu/∼wachs.