Symmetry analysis of reversible markov chains

Internet Mathematics

Volumn 2, Issue 1, 2005, Pages 31-71

  Boyd, Stephen ^a   Diaconis, Persi ^b   Parrilo, Pablo ^c   Xiao, Lin ^d  

^a Stanford University   (United States)

^b STANFORD UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 29844451677     PISSN: 15427951     EISSN: None     Source Type: Journal    
DOI: 10.1080/15427951.2005.10129100     Document Type: Article

References (37)

1. D. Aldous and J. Fill. Reversible Markov Chains and Random Walks on Graphs. Preprint available from World Wide Web (http://statwww.berkeley.edu/users/aldous/RWG/book.html). Manuscript, 2003.
2. L. Babai. “Automorphism Groups, Isomorphism, Reconstruction.” In Handbook of Combinatorics, Volume 2, edited by R. Graham et al., pp. 1447–1540. Amsterdam: Elsevier, 1995.
3. E. Belsley. “Rates of Convergence of Random Walk on Distance-Regular Graphs.” Probability Theory and Related Fields 112:4 (1998), 493–533.
4. S. Boyd, P. Diaconis, and L. Xiao. “Fastest Mixing Markov Chain on a Graph.” SIAM Review 46 (2004), 667–689.
5. P. Brémaud. Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues, Texts in Applied Mathematics 31. Berlin-Heidelberg: Springer-Verlag, 1999.
6. P. Cameron. Permutation Groups. Cambridge, UK: Cambridge University Press, 1999.
7. P. Cameron. “Coherent Configurations, Association Schemes and Permutation Groups.” In Groups, Combinatorics and Geometry, edited by A. Ivanov, M. Liebeck, and J. Saxl, pp. 55–72. River Edge, NJ: World Scientific, 2003.
8. A. Chan and C. Godsil. “Symmetry and Eigenvectors.” In Graph Symmetry, Algebraic Methods and Applications, edited by G. Hahn and G. Sabidussi, pp. 75–106. Dordrecht, The Netherlands: Kluwer, 1997.
9. F. R. K. Chung. Spectral Graph Theory. Providence, RI: American Mathematics Society, 1997.
10. C. Curtis and I. Reiner. Representation Theory of Finite Groups and Associative Algebras. New York: Wiley, 1962.
11. D. Cvetković, M. Doob, and H. Sachs. Spectra of Graphs, Third edition. New York: Academic Press, 1995.
12. P. Diaconis. Group Representations in Probability and Statistics. Hayward, CA: IMS, 1988.
13. P. Diaconis and J. A. Fill. “Strong Stationary Times via a New Form of Duality.” The Annals of Probability 18:4 (1990), 1483–1522.
14. P. Diaconis, S. Holmes, and R. M. Neal. “Analysis of a Nonreversible Markov Chain Sampler.” The Annals of Applied Probability 10 (2000), 726–752.
15. P. Diaconis and L. Saloff-Coste. “Comparison Theorems for Reversible Markov Chains.” The Annals of Applied Probability 3 (1993), 696–730.
16. P. Diaconis and D. Stroock. “Geometric Bounds for Eigenvalues of Markov Chains.” The Annals of Applied Probability 1:1 (1991), 36–61.
17. J. Dieudonne. Treatise on Analysis VI. New York: Academic Press, 1978.
18. P. Erdös, A. Renyi, and V. Sós. “On a Problem of Graph Theory.” Studia Sci. Math. Hungar. 1 (1966), 215–235.
19. A. Fässler and E. Stiefel. Group Theoretical Methods and Their Applications. Boston: Birkhäuser, 1992.
20. W. Feller. An Introduction to Probability Theory and Its Applications, Vol. 1. New York: Wiley, 1968.
21. K. Gatermann and P. A. Parrilo. “Symmetry Groups, Semidefinite Programs, and Sums of Squares.”Journal of Pure and Appl. Algebra 192:1–3 (2004), 95–128.
22. C. Godsil and G. Royle. Algebraic Graph Theory. New York: Springer, 2001.
23. T. Halverson and A. Ram. “Murnaghan-Nakayama Rules for Characters of Iwahori-Hecke Algebras of Classical Type.” Trans. of Amer. Math. Soc. 348 (1996), 3967–3995.
24. G. James and A. Kerber. The Representation Theory of the Symmetric Group. Reading, MA: Addison-Wesley, 1981.
25. M. Kac. “Random Walk and the Theory of Brownian Motion.” American Mathematical Monthly 54 (1947), 369–391.
26. J. G. Kemeney and J. L. Snell. Finite Markov Chains. Princeton, NJ: Van Nostrand, 1960.
27. J. Lauri and R. Scapellato. Topics in Graph Automorphisms and Reconstruction. Cambridge, UK: Cambridge University Press, 2003.
28. J. Liu. Monte Carlo Strategies in Scientific Computing, Springer Series in Statistics XVI. New York: Springer-Verlag, 2001.
29. G. Mackey. Unitary Group Representations in Physics, Probability and Number Theory. New York: Benjamin, 1978.
30. P. Neumann. “A Lemma that is not Burnsides.” Math. Scientist 4 (1979), 13–141.
31. P. A. Parrilo, L. Xiao, S. Boyd, and P. Diaconis. “Fastest Mixing Markov Chain on Graphs with Symmetries.” Manuscript in preparation, 2004.
32. M. Pinsky. “The Eigenvalues of an Equilateral Triangle.” SIAM Journal on Mathematical Analysis 11 (1980), 819–827.
33. M. Pinsky. “Completeness of the Eigenfunctions of the Equilateral Triangle.” SIAM Journal on Mathematical Analysis 16 (1985), 848–851.
34. L. Saloff-Coste. “Lectures on Finite Markov Chains.” In Lectures on Probability Theory and Statistics, Lecture Notes in Mathematics 1665, edited by P. Bernard, pp. 301–413. Berlin: Springer-Verlag, 1997.
35. L. Saloff-Coste. “Random Walk on Finite Groups.” In Probability on Discrete Structures, Encyclopedia of Mathematical Sciences 110, edited by H. Kesten, pp. 263–346. Berlin: Springer-Verlag, 2004
36. S. Sternberg. Group Theory and Physics. Cambridge, UK: Cambridge University Press, 1994.
37. R. Stong. “Choosing a Random Spanning Tree: A Case Study.” Theoretical Probab. 4 (1991), 753–766.