Skip to main content
SpringerLink
Log in

Random Walks on Finite Groups

  • Chapter
Probability on Discrete Structures

Part of the book series: Encyclopaedia of Mathematical Sciences ((EMS,volume 110))

Summary

Markov chains on finite sets are used in a great variety of situations to approximate, understand and sample from their limit distribution. A familiar example is provided by card shuffling methods. From this viewpoint, one is interested in the “mixing time” of the chain, that is, the time at which the chain gives a good approximation of the limit distribution. A remarkable phenomenon known as the cut-off phenomenon asserts that this often happens abruptly so that it really makes sense to talk about “the mixing time”. Random walks on finite groups generalize card shuffling models by replacing the symmetric group by other finite groups. One then would like to understand how the structure of a particular class of groups relates to the mixing time of natural random walks on those groups. It turns out that this is an extremely rich problem which is very far to be understood. Techniques from a great variety of different fields — Probability, Algebra, Representation Theory, Functional Analysis, Geometry, Combinatorics — have been used to attack special instances of this problem. This article gives a general overview of this area of research.

Research supported in part by NSF grant DMS 0102126

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aldous, D. (1983): Random walks on finite groups and rapidly mixing Markov chains. In Séminaire de Probabilités, XVII, Lec. Notes in Math. 986, Springer, Berlin.

    Google Scholar 

  2. Aldous, D. (1987): On the Markov-chain simulation method for uniform combinatorial simulation and simulated annealing. Prob. Eng. Info. Sci. 1, 33-46.

    Google Scholar 

  3. Aldous, D., Fill, J.A. (1995) Preliminary version of a book on finite Markov chains. http://www.stat.berkeley.edu/users/aldous

    Google Scholar 

  4. Aldous, D., Diaconis, P. (1986): Shuffling cards and stopping times. Amer. Math. Monthly 93, 333-348

    Google Scholar 

  5. Aldous, D., Diaconis, P. (1987): Strong uniform times and finite random walks. Adv. Appl. Math. 8, 69-97.

    Google Scholar 

  6. Alon, N., Roichman, Y. (1994): Random Cayley graphs and expanders. Random Struct. and Alg. 5, 271 - 284.

    Article  MathSciNet  MATH  Google Scholar 

  7. Astashkevich, A., Pak, I. (2001): Random walks on nilpotent groups. Preprint.

    Google Scholar 

  8. Babai, L. (1995): Automorphism groups, isomorphism, reconstruction. Handbook of combinatorics, Vol. 1, 2, 1447-1540, Elsevier.

    Google Scholar 

  9. Babai, L., Szegedy, M. (1992): Local expansion of symmetrical graphs. Combin. Probab. Comput. 1, 1-11.

    Google Scholar 

  10. Babai, L., Hetyii, G., Kantor, W., Lubotzky, A., Seress, A. (1990): On the diameter of finite groups. 31 IEEE Symp. on Found. of Comp. Sci. ( FOCS 1990 ) 857-865.

    Google Scholar 

  11. Babai, L., Kantor, W., Lubotzky, A. (1992): Small diameter Cayley graphs for finite simple groups. European J. Comb. 10, 507-522.

    Google Scholar 

  12. Bacher, R. (1994): Valeur propre minimale du laplacien de Coxeter pour le groupe symétrique. J. Algebra 167, 460 - 472.

    Article  MathSciNet  MATH  Google Scholar 

  13. Bayer, D., Diaconis, P. (1986): Trailing the dovetail shuffle to its lair. Ann. Appl. Probab. 2, 294 - 313.

    Article  MathSciNet  Google Scholar 

  14. Billera, L., Brown, K., Diaconis, P. (1999): Random walks and plane arrangements in three dimensions. Amer. Math. Monthly 106, 502-524.

    Google Scholar 

  15. Borel, E., Chéron, A. (1940): Théorie Mathématique du Bridge à la Portée de Tous, Gauthier-Villars, Paris.

    Google Scholar 

  16. Brown, K. (2000): Semigroups, rings, and Markov chains. J. Theoret. Probab. 13, 871 - 938.

    Article  MathSciNet  MATH  Google Scholar 

  17. Brown, K., Diaconis, P. (1998): Random walks and hyperplane arrangements. Ann. Probab. 26, 1813 - 1854.

    Article  MathSciNet  MATH  Google Scholar 

  18. Burdzy, K., Kendall, W. (2000): Efficient Markovian couplings: examples and counterexamples. Ann. Appl. Probab. 10, 362 - 409.

    Article  MathSciNet  Google Scholar 

  19. Cartier, P., Foata, D. (1969): Problèmes Combinatoires de Commutation et Réarrangements. Lec. Notes. Math. 85, Springer.

    Google Scholar 

  20. Chavel, I. (1984): Eigenvalues in Riemannian Geometry. Academic Press.

    Google Scholar 

  21. Coppersmith, D., Pak, I. (2000): Random walk on upper triangular matrices mixes rapidly. Probab. Theory Related Fields 117, 407 - 417.

    Article  MathSciNet  MATH  Google Scholar 

  22. Chung, F., Faber, V., Manteuffel, T. (1994): An upper bound on the diameter of a graph from eigenvalues associated with its Laplacian. SIAM J. Discrete Math. 7, 443 - 457.

    Article  MathSciNet  MATH  Google Scholar 

  23. Dai, J. (1998): Some results concerning random walk on finite groups. Statist. Probab. Lett. 37, 15 - 17.

    Article  MathSciNet  MATH  Google Scholar 

  24. Dai, J., Hildebrand, M. (1997): Random random walks on the integers mod ri. Statist. Probab. Lett. 35, 371 - 379.

    Article  MathSciNet  MATH  Google Scholar 

  25. Davidoff, G., Sarnak, P. (2003): Elementary Number Theory, Group Theory and Ramanujan Graphs. Cambridge University Press.

    Google Scholar 

  26. Diaconis, P. (1982): Applications of non-commutative Fourier analysis to probability problems. Lec. Notes in Math. 1362, 51-100, Springer.

    Google Scholar 

  27. Diaconis, P. (1988): Group representations in probability and statistics. Institute of Mathematical Statistics Lecture Notes-Monograph Series, 11. Hayward, CA.

    Google Scholar 

  28. Diaconis, P. (1991): Finite Fourier methods: Access to tools. Proc. Symp. Appl. Math. 44, 171 - 194.

    Article  MathSciNet  Google Scholar 

  29. Diaconis, P. (1998): From shuffling cards to walking around the building: an introduction to modern Markov chain theory. Proceedings of the International Congress of Mathematicians, Vol. I (Berlin, 1998 ). Doc. Math., 187 - 204.

    Google Scholar 

  30. Diaconis, P. (2000): The cut-off phenomenon in finite Markov chains. Proc. Natl. Acad. Sci. USA 93, 1659 - 1664.

    Article  MathSciNet  Google Scholar 

  31. Diaconis, P. (2003): Random walks on groups: characters and geometry. Groups St. Andrews, Neuman, P. et al (eds).

    Google Scholar 

  32. Diaconis, P. (2003): Mathematical developments from the analysis of riffle shuffling. In: M. Liebeck (ed), Proc. Durham conference on groups.

    Google Scholar 

  33. Diaconis, P., Fill, J.A. (1990): Srong stationary times via a new form of duality. Ann. Probab. 18, 1483 - 1522.

    Article  MathSciNet  MATH  Google Scholar 

  34. Diaconis, P., Fill, J.A., Pitman, J. (1992): Analysis of top to random shuffles. Combin. Probab. Comput. 1, 135 - 155.

    Article  MathSciNet  MATH  Google Scholar 

  35. Diaconis, P., Graham, R., Morrison, J. (1990): Asymptotic analysis of a random walk on a hypercube with many dimensions. Random Struct. and Alg. 1, 51 - 72.

    Article  MathSciNet  MATH  Google Scholar 

  36. Diaconis, P., Hanlon, P. (1992): Eigen-analysis for some examples of the Metropolis algorithm. Contemp. Math. 138, 99 - 117.

    Article  MathSciNet  Google Scholar 

  37. Diaconis, P., Holmes, S. (2001): Analysis of a card mixing scheme, unpublished report.

    Google Scholar 

  38. Diaconis, P., Holmes, S. (2002): Random walks on trees and matchings. Electron. J. Probab. 7, 17 pp. (electronic).

    Google Scholar 

  39. Diaconis, P., Holmes, S., Neals, B. (2000): Analysis of a nonreversible Markov chain sampler. Ann. Appl. Probab. 10, 726 - 752.

    Article  MathSciNet  MATH  Google Scholar 

  40. Diaconis, P., McGrath, M., Pitman, J. (1995): Riffle shuffles, cycles, and descents. Combinatorica 15, 11-29.

    Google Scholar 

  41. Diaconis, P., Ram, A. (2000): Analysis of systematic scan Metropolis algorithms using Iwahori-Hecke algebra techniques. Mich. Math. jour. 48, 157 - 190.

    Article  MathSciNet  MATH  Google Scholar 

  42. Diaconis, P., Saloff-Coste, L. (1993): Comparison techniques for random walk on finite groups. Ann. Probab. 21, 2131 - 2156.

    Article  MathSciNet  MATH  Google Scholar 

  43. Diaconis, P., Saloff-Coste, L. (1993): Comparison techniques for reversible Markov chains. Ann. Probab. 3, 696 - 730.

    Article  MathSciNet  MATH  Google Scholar 

  44. Diaconis, P., Salof Coste, L. (1994): Moderate growth and random walk on finite groups. GAFA, 4, 1 - 36.

    Article  MATH  Google Scholar 

  45. Diaconis, P., Saloff-Coste, L. (1995): Random walks on finite groups: a survey of analytic techniques. In Probability measures on groups and related structures XI (Oberwolfach, 1994), 44-75. World Scientific.

    Google Scholar 

  46. Diaconis, P., Saloff-Coste, L. (1995): An application of Harnack inequalities to random walk on nilpotent quotients. J. Fourier Anal. Appl. Proceedings of the Conference in Honor of J.P. Kahane. 190 - 207.

    Google Scholar 

  47. Diaconis, P., Saloff-Coste, L. (1996): Nash inequalities for finite Markov chains. J. Theoret. Probab. 9, 459 - 510.

    Article  MathSciNet  MATH  Google Scholar 

  48. Diaconis, P., Saloff-Coste, L. (1996): Logarithmic Sobolev inequalities for finite Markov chains. Ann. Appl. Probab. 6, 695 - 750.

    Article  MathSciNet  MATH  Google Scholar 

  49. Diaconis, P., Saloff-Coste, L. (1996): Walks on generating sets of abelian groups. Probab. Theory Related Fields 105, 393-421.

    Google Scholar 

  50. Diaconis, P., Shahshahani, M. (1981): Generating a random permutation with random transpositions. Z. Wahrsch. Verw. Geb. 57, 159 - 179.

    Article  MathSciNet  MATH  Google Scholar 

  51. Diaconis, P., Stroock, D. (1991): Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Probab. 1, 36 - 61.

    Article  MathSciNet  MATH  Google Scholar 

  52. Dixon, J. (1969): The probability of generating the symmetric group. Math. Z. 110, 199 - 205.

    Article  MathSciNet  MATH  Google Scholar 

  53. Dou C. (1992): Studies of random walks on groups and random graphs. Ph.D. Dissertation, Dept. of Math., Massachusetts Institute of Technology.

    Google Scholar 

  54. Dou, C., Hildebrand, M. (1996): Enumeration and random walks on finite groups. Ann. Probab. 24 987 - 1000.

    Article  MathSciNet  MATH  Google Scholar 

  55. Durrett, R. (2003): Shuffling Chromosomes. J. Theoret. Probab. (to appear )

    Google Scholar 

  56. Ellenberg, J. (1993) A sharp diameter bound for upper triangular matrices. Senior honors thesis, Dept. Math. Harvard University.

    Google Scholar 

  57. Fill, J.A. (1991): Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains with an application to the exclusion processes. Ann. Appl. Probab. 1, 62-87.

    Google Scholar 

  58. Fill, J.A., Schoolfield, C. (2001): Mixing times for Markov chains on wreath products and related homogeneous spaces. Electron. J. Probab. 6, 22 p.

    MathSciNet  Google Scholar 

  59. Flatto, L., Odlyzko, A., Wales, D. (1985): Random shuffles and group representations. Ann. Probab. 13, 151 - 178.

    Article  MathSciNet  Google Scholar 

  60. Fulman, J. (2000): Semisimple orbits of Lie algebra and card shuffling measures on Coxeter groups, J. Algebra 224, 151 - 165.

    Article  MathSciNet  MATH  Google Scholar 

  61. Fulman, J. (2000): Application of the Brauer complex: card shuffling, permutation statistics, and dynamical systems, J. Algebra 243, 96 - 122.

    Article  MathSciNet  Google Scholar 

  62. Fulman, J. Wilmer, E. (1999): Comparing eigenvalue bounds for Markov chains: when does Poincaré beat Cheeger. Ann. Appl. Probab. 9, 1 - 13.

    MathSciNet  MATH  Google Scholar 

  63. Gamburd, A. (2002): On the spectral gap for infinite index "congruence" subgroups of SL2(Z). Israel J. Math. 127, 157 - 2000

    MathSciNet  Google Scholar 

  64. Gamburd, A. (2003): Expander graphs, random matrices and quantum chaos. In: Kaimanovich, V. et al eds., Random walks and Geometry (Vienna, 2001), de Gruyter.

    Google Scholar 

  65. Gamburd, A., Pak, I. (2001): Expansion of product replacement graphs. Preprint.

    Google Scholar 

  66. Gilbert, E. (1955): Theory of Shuffling. Technical Memorandum, Bell Laboratories.

    Google Scholar 

  67. Gluck, D. (1995): Sharper character value estimates for groups of Lie type. J. Algebra 174, 229 - 266.

    Article  MathSciNet  MATH  Google Scholar 

  68. Gluck, D. (1997): Characters and random walks on finite classical groups. Adv. Math. 129, 46 - 72.

    Article  MathSciNet  MATH  Google Scholar 

  69. Gluck, D. (1999): First hitting time for some random walks on finite groups. J. Theoret. Probab. 12, 739 - 755.

    Article  MathSciNet  MATH  Google Scholar 

  70. Good, I. (1951): Random motion on a finite Abelian group. Proc. CambridgePhil. Soc. 47, 756 - 762.

    MathSciNet  MATH  Google Scholar 

  71. Greenberg, Y. (1995): Ph.D. Thesis, Hebrew University, Jerusalem.

    Google Scholar 

  72. Greenhalgh, A. (1987): Random walks on groups with subgroup invariance properties. Ph.D. Thesis, Dept. of Math., Stanford University.

    Google Scholar 

  73. Greenhalgh, A (1997). A model for random random-walks on finite groups. Combin. Probab. Comput. 6, 49 - 56.

    Article  MathSciNet  MATH  Google Scholar 

  74. Grigorchuck, R., Zuk, A. (1999): On the asymptotic spectrum of random walks on infinite families of graphs. In: Picardello and Woess, eds., Random walks and discrete potential theory (Cortona, 1997 ), 188 - 204, Sympos. Math., XXXIX, Cambridge Univ. Press

    Google Scholar 

  75. Gromov, M. (1981): Groups of polynomial growth and expanding maps. Publ. Math. I.H.E.S. 53, 53 - 81.

    MathSciNet  MATH  Google Scholar 

  76. Grove, L. (2001): Classical Groups and Geometric Algebra. Graduate Studies in Mathematics 39, American Math. Soc.

    Google Scholar 

  77. Häggström, O., Jonasson, J. (1997): Rates of convergence for lamplighter processes. Stochastic Process. Appl. 67, 227-249.

    Google Scholar 

  78. Hall, M. (1976): The theory of groups, sec. ed., Chelsea, New York.

    Google Scholar 

  79. Hall, P. (1957): Nilpotent groups. In Collected Works of Philip Hall, Oxford University press, 417 - 462.

    Google Scholar 

  80. Handjani, S., Jungreis, D. (1996): Rate of convergence for shuffling cards by transpositions. J. Theoret. Probab. 9, 983 - 993.

    Article  MathSciNet  MATH  Google Scholar 

  81. Hannan, E.J. (1965) Group representation and applied probability. J. Appl. Probab. 2 1 - 68.

    Article  MathSciNet  MATH  Google Scholar 

  82. de la Harpe, P. (2000): Topics in Geometric Group Theory. Chicago Lectures in Mathematics, Chicago University Press.

    MATH  Google Scholar 

  83. de la Harpe, P., Valette, A. (1989): La propriété (T) de Kazhdan pour les groupes localement compacts. Astérisque 175, SMF.

    Google Scholar 

  84. Harper, L. (2003) Global Methods for Combinatorial Isoperimetric Problems, monograph to be published by Cambridge University Press.

    Google Scholar 

  85. Hildebrand, M. (1990): Rates of convergence of some random processes on finite groups. Ph. D thesis, Department of Mathematics, Harvard University.

    Google Scholar 

  86. Hildebrand, M. (1992): Generating random elements in SL,,(F Q ) by random transvections. J. Alg. Combinatorics 1, 133 - 150.

    Article  MathSciNet  MATH  Google Scholar 

  87. Hildebrand, M. (1994): Random walks supported on random points of Z/nZ. Probab. Theory Related Fields 100, 191 - 203.

    Article  MathSciNet  MATH  Google Scholar 

  88. Hildebrand, M. (2001): Random lazy random walks on arbitrary finite groups. J. Theoret. probab. 14, 1019 - 1034.

    Article  MathSciNet  MATH  Google Scholar 

  89. Hildebrand, M. (2002): A note on various holding probabilities for random lazy random walks on finite groups. Statist. Probab. Lett. 56, 199 - 206.

    Article  MathSciNet  MATH  Google Scholar 

  90. Horn, R., Johnson, C. (1985): Matrix analysis Cambridge University Press.

    Google Scholar 

  91. Horn, R., Johnson, C. (1991): Topics in matrix analysis. Cambridge University Press.

    Google Scholar 

  92. Hostinsky, M. (1931): Méthodes générales du calcul des probabilités. Gauthier-Villars, Paris.

    MATH  Google Scholar 

  93. Ingram, R.E. (1950): Some characters of the symmetric group. Proc. Amer. Math. Soc. 1, 358 - 369.

    Article  MathSciNet  MATH  Google Scholar 

  94. Jerrum, M. (1998): Mathematical foundations of the Markov chain Monte Carlo method. In Probabilistic methods for algorithmic discrete mathematics Algorithms Combin. 16, 116 - 165.

    Chapter  Google Scholar 

  95. Kosambi, D., Rao, U.V.R. (1958) The efficiency of randomization by card shuffling. J. R. Statist. Soc. A 128, 223 - 233.

    Google Scholar 

  96. Leader, I. (1991): Discrete isoperimetric inequalities. In Probabilistic combinatorics and its applications (San Francisco, CA, 1991). Proc. Sympos. Appl. Math. 44, 57 - 80. Amer. Math. Soc.

    Chapter  Google Scholar 

  97. Liebeck, M., Shalev, A. (2001): Diameters of finite simple groups: sharp bounds and applications. Ann. of Math. 154, 383 - 406.

    Article  MathSciNet  MATH  Google Scholar 

  98. Lubotzky, A. (1994): Discrete Groups, expanding graphs and invariant measures. Birkhäuser.

    Google Scholar 

  99. Lubotzky, A. (1995): Cayley graphs: Eigenvalues, Expanders and Random Walks. Surveys in combinatorics, 155-189, London Math. Soc. Lecture Note Ser., 218, Cambridge Univ. Press.

    Google Scholar 

  100. Lubotzky, A., Pak, I. (2000): The product replacement algorithm and Kazhdan's property (T). J. Amer. Math. Soc. 14, 347 - 363.

    Article  MathSciNet  Google Scholar 

  101. Lubotzky, A., Phillips, R., Sarnak, P. (1988): Ramanujan graphs. Combinatorica, 8, 261 - 277.

    Article  MathSciNet  MATH  Google Scholar 

  102. Lulov, N. (1996): Random walks on the symmetric group generated by conjugacy classes. Ph.D. Thesis, Harvard University.

    Google Scholar 

  103. Lulov, N., Pak, I. (2002): Rapidly mixing random walks and bounds on characters of the symmetric group. Preprint.

    Google Scholar 

  104. Markov, A. (1906): Extension of the law of large numbers to dependent events, Bull. Soc. Math. Kazan 2, 155 - 156.

    Google Scholar 

  105. Matthews, P. (1987): Mixing rates for a random walk on the cube. SIAM J. Algebraic Discrete Methods 8, no. 4, 746 - 752.

    Article  MathSciNet  MATH  Google Scholar 

  106. Matthews, P. (1988): A strong uniform time for random transpositions. J. Theoret. Probab. 1, 411-423.

    Google Scholar 

  107. Matthews, P. (1992): Strong statinary times and eigenvalues. J. Appl. Probab. 29, 228 - 233.

    Article  MathSciNet  MATH  Google Scholar 

  108. Margulis, G. (1975): Explicit constructions of concentrators. Prob. of Inform. Transm. 10, 325-332.

    Google Scholar 

  109. McDonald, I. (1979): Symmetric functions and Hall polynomials. Clarendon Press, Oxford.

    Google Scholar 

  110. Mohar, B. (1989): Isoperimetric numbers of graphs. J. Combin. Theory 47, 274-291.

    Google Scholar 

  111. Morris, B., Peres, Y. (2002): Evolving sets and mixing. Preprint.

    Google Scholar 

  112. Pak, I. (1997): Random walks on groups: strong uniform time approach. Ph.D. Thesis, Department of Math. Harvard University.

    Google Scholar 

  113. Pak, I. (1999): Random walks on finite groups with few random generators. Electron. J. Probab. 4, 1-11.

    Google Scholar 

  114. Pak, I. (2000): Two random walks on upper triangular matrices. J. Theoret. Probab. 13, 1083-1100.

    Google Scholar 

  115. Pak, I, Zuk, A. (2002): On Kazhdan constants and mixing of random walks. Int. Math. Res. Not. 2002, no. 36, 1891 - 1905.

    Article  MathSciNet  MATH  Google Scholar 

  116. Pemantle, R. (1989): An analysis of the overhand shuffle. J. Theoret. Probab. 2, 37-50.

    Google Scholar 

  117. Quenell, G. (1994): Spectral diameter estimates for k-regular graphs. Adv. Math. 106, 122 - 148.

    Article  MathSciNet  MATH  Google Scholar 

  118. Reeds, J. (1981): Theory of riffle shuffling. Unpublished manuscript.

    Google Scholar 

  119. Roichman, Y. (1996): Upper bound on the characters of the symmetric groups. Invent. Math. 125, 451 - 485.

    Article  MathSciNet  MATH  Google Scholar 

  120. Roichman, Y. (1996): On random random walks. Ann. Probab. 24, 1001 - 1011.

    Article  MathSciNet  MATH  Google Scholar 

  121. Roussel, S. (1999): Marches aléatoires sur le groupe symétrique. Thèse de Doctorat, Toulouse.

    Google Scholar 

  122. Roussel, S. (2000): Phénomène de cutoff pour certaines marches aléatoires sur le groupe symétrique. Colloquium Math. 86, 111 - 135.

    MathSciNet  MATH  Google Scholar 

  123. Saloff-Coste, L. (1994): Precise estimates on the rate at which certain diffusions tend to equilibrium. Math. Zeit. 217, 641-677.

    Google Scholar 

  124. Saloff-Coste, L. (1997): Lectures on finite Markov Chains. In Lectures in Probability and Statistics, Lect. Notes in Math. 1665, Springer.

    Google Scholar 

  125. Saloff-Coste, L. (2001): Probability on groups: random walks and invariant diffusions. Notices Amer. Math. Soc. 48, 968-977.

    Google Scholar 

  126. Saloff-Coste, L. (2003): Lower bounds in total variation for finite Markov chains: Wilson's lemma. In: Kaimanovich, V. et al eds., Random walks and Geometry (Vienna, 2001), de Gruyter.

    Google Scholar 

  127. Sarnak, P. (1990): Some applications of Modular Forms Cambridge Tracts in Mathematics 99, Cambridge University Press.

    Google Scholar 

  128. Schoolfield, C. (1998): Random walks on wreath products of groups and Markov chains on related homogeneous spaces. Ph.D. dissertation, Department of Mathematical Sciences, The John Hopkins University.

    Google Scholar 

  129. Schoolfield, C. (2002): Random walks on wreath products of groups. J. Theoret. Probab. 15, 667-693.

    Google Scholar 

  130. Shalev, A. (2000): Asymptotic group theory. Notices Amer. Soc. 48 383 - 389.

    MathSciNet  Google Scholar 

  131. Sinclair, A. (1993): Algorithms for random generation and counting: a Markov chain approach. Birkhäuser, Boston.

    Google Scholar 

  132. Stong, R. (1995): Random walks on the group of upper triangular matrices. Ann. Probab. 23, 1939 - 1949.

    Article  MathSciNet  MATH  Google Scholar 

  133. Stong, R. (1995): Eigenvalues of the natural random walk on the Burnside group B(3, n). Ann. Probab. 23, 1950 - 1960.

    Article  MathSciNet  MATH  Google Scholar 

  134. Stong, R. (1995): Eigenvalues of random walks on groups. Ann. Probab. 23, 1961 - 1981.

    Article  MathSciNet  MATH  Google Scholar 

  135. Suzuki, M. ( 1982, 1986): Group theory I, II. Springer, New York.

    Google Scholar 

  136. Terras, A. (1999): Fourier Analysis on Finite Groups and Applications. London Math. Soc. Student Texts 43, Cambridge University Press.

    Google Scholar 

  137. Thorpe, E. (1973): Nonrandom shuffling with applications to the game of Faro. J.A.S.A. 68, 842 - 847.

    Article  Google Scholar 

  138. Uyemura-Reyes, J-C. (2002): Random walk, semidirect products, and card shuffling. Ph.D. dissertation, Department of Mathematics, Stanford University.

    Google Scholar 

  139. Varopulos, N. Saloff-Coste, L., Coulhon, T. (1992): Analysis and Geometry on Groups. Cambridge Tracts in Mathematics 100, Cambridge University Press.

    Google Scholar 

  140. Wilson, D. (1997): Random random walks on Z1. Probab. Theory Related Fields 108, 441 - 457.

    Article  MathSciNet  MATH  Google Scholar 

  141. Wilson, D. (2001): Mixing times of lozenge tiling and card shuffling Markov chains. To appear in Ann. Appl. Probab. arXiv:math.PR/0102193 26 Feb 2001.

    Google Scholar 

  142. Wilson, D. (2002): Mixing time of the Rudvalis shuffle. Preprint.

    Google Scholar 

  143. Woess, W. (1980): Aperiodische Wahrscheinlichkeitsmasse auf topologischen Gruppen. Mh. Math. 90, 339 - 345.

    Article  MathSciNet  MATH  Google Scholar 

  144. Woess, W. (1983): Périodicité de mesures de probabilité sur les groupes topologiques. In Marches Aléatoires et Processus Stochastiques sur le Groupe de Lie. Inst. Elie Cartan, 7, 170 - 180. Univ. Nancy.

    Google Scholar 

  145. Woess, W. (2000): Random walks on infinite graphs and groups. Cambridge Tracts in Mathematics 138 Cambridge University Press.

    Google Scholar 

  146. Zuk, A. (2002): On property (T) for discrete groups. In Rigidity in dynamics and geometry (Cambridge, 2000), 473 - 482, Springer, Berlin.

    Chapter  Google Scholar 

Download references

Authors
  1. Laurent Saloff-Coste
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Cornell University Department of Mathematics, Malott Hall 310, 14853-4201, Ithaca, NY, USA

    Harry Kesten

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Saloff-Coste, L. (2004). Random Walks on Finite Groups. In: Kesten, H. (eds) Probability on Discrete Structures. Encyclopaedia of Mathematical Sciences, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-09444-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-09444-0_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-05647-5

  • Online ISBN: 978-3-662-09444-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation