Walks on generating sets of groups

Inventiones Mathematicae

Volumn 134, Issue 2, 1998, Pages 251-299

  Diaconis, P ^a   Saloff Coste, L ^b  

^a Department of Obstetrics Gynecology   (United States)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040676602     PISSN: 00209910     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002220050265     Document Type: Article

References (35)

1. L. Babai: The probability of generating the symmetric group. J. Comb. Theory. A., 52, 148-153 (1989)
2. rd ACM STOC. 164-174 (1991)
3. L. Babai: On the length of subgroup chains in the symmetric group Comm. Alg., 14, 1729-1736 (1986)
4. L. Babai: Randomization in Group Algorithms: Conceptual Questions. Preprint (1996)
5. L. Babai., G. Hetyei., W.M. Kantor., A. Lubotzky., Á. Seress: On the diameter of finite groups. Foundations of Computer Science, 31st Annual Symposium, IEEE, 857-865 (1990)
6. L. Babai., Á. Seress: On the diameter of Cayley graphs of the symmetric group. J. Comb. Theory, A, 49, 175-179 (1988)
7. L. Babai., and Á. Seress: On the diameter of permutation groups. European J. Comb. 13, 231-243 (1992)
8. P., Cameron., R. Solomon., A. Turull: Chains of subgroups in symmetric groups. Jour. Alg. 127, 340-352 (1989)
9. F. Celler., C. Leedham-Green., S. Murray., A. Niemeyer., E. O'Brien: Generating random elements of a finite group. Communications in Algebra, 23, 4931-4948 (1995)
10. G. Constantine: Combinatorial theory and statistical design. Wiley, New York (1987)
11. F. Chung., R. Graham: Random walks on generating sets for finite groups. Electronic Journal of Combinatorics, 2, no. R7 (1997)
12. F. Chung., R. Graham: Stratified Random walks on an n-cube. Random Structures and Algorithms, 1, 199-222 (1997)
13. P. Diaconis: Group representations in probability and statistics. IMS, Hayward (1986)
14. P. Diaconis., R.L. Graham R.L: The graph of generating sets of an Abelian group. Preprint, Dept. of Math. Harvard University (1995)
15. P. Diaconis., S. Holmes: Statistical testing of computer algorithms for generating random elements of finite groups (1996)
16. P. Diaconis., L. Saloflf-Coste: Comparison theorems for reversible Markov chains. Ann. Appl. Prob.3, 696-730 (1993)
17. P. Diaconis., L. Saloff-Coste: Comparison techniques for random walk on finite groups. Ann. Prob. 21, 2131-2156 (1993)
18. P. Diaconis., L. Saloff-Coste: Logarithmic Sobolev inequalities and finite Markov chains. Ann. Appl. Prob. 6, 695-750 (1996)
19. P. Diaconis., L. Saloff-Coste: Moderate growth and random walk on finite groups. G.A.F.A., 4, 1-36 (1992)
20. P. Diaconis., L. Saloff-Coste: Walks on generating sets of Abelian groups. Prob. Th. Rel. Fields. 105, 393-421 (1996)
21. P. Diaconis., L. Saloff-Coste: Random walks on finite groups: a survey of analytical techniques. In Probability on groups and related structures XI, Heyer (ed). World Scientific (1995)
22. P. Diaconis., M. Sahshahani: The subgroup algorithm for generating uniform random variables. Probl. in Engin. Info. Sci., 1, 15-32 (1987)
23. P. Diaconis., D. Stroock: Geometric bounds for eigenvalues for Markov chains. Ann. Appl. Prob. 1, 36-61 (1991)
24. L. Finkelstein., W. Kantor: Groups and Computation. Amer. Math. Soc. Providence (1993)
25. W. Gaschütz: Die Eulersche funktion endlicher auflösbarer gruppen. Illinois J. Math., 3, 469-476 (1959)
26. M. Hall: The theory of groups. (Sec. Ed., 1976) Chelsea Publishing Company. New York (1959)
27. P. Hall: The Eulerian functions of a group. Quart. J. Math. 7, 134-151 (1936)
28. G. Hardy., E. Wright: An Introduction to the theory of numbers. (Fifth ed.), Oxford University Press (1938)
29. T. Hawkes., M. Issacs and M. Özaydin: On the Möbius function of a finite group. Rocky Mountain J. Math. 19, 1003-1034 (1989)
30. D. Holt and S. Rees: An implementation of the Neumann-Praeger algorithm for the recognition of special linear groups. Jour. Exper. Math. 1, 237-242 (1992)
31. M. Issacs: The number of generators of a linear p-group. Can. J. Math. 24, 851-858 (1972)
32. P. Neumann., S. Praeger: A recognition algorithm for special linear groups. Proc. London Math. Soc. 65, 555-603 (1992)
33. L. Pyber: Asymptotic results for permutation groups. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 11, 197-219 (1993)
34. A. Sinclair: Algorithms for random generation and counting: a Markov chain approach. Birkhäuser, Boston (1993)
35. M. Suzuki: Group theory I,II. Springer, New York (1982)