Expansion of product replacement graphs

Combinatorica

Volumn 26, Issue 4, 2006, Pages 411-429

  Gamburd, Alexander ^a   Pak, Igor ^b  

^a STANFORD UNIVERSITY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33749353462     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-006-0023-0     Document Type: Article

References (63)

1. 1, isoperimetric inequalities for graphs, and superconcentrators; J. Comb. Theory, Ser. B 38 (1985), 73-88.
2. N. ALON and Y. ROICHMAN: Random Cayley graphs and expanders, Random Structures and Algorithms 5 (1994), 271-284.
3. L. BABAI: The probability of generating the symmetric group, J. Comb. Th. Ser. A 52 (1989), 148-153.
4. rd ACM STOC, 1991, pp. 164-174.
5. L. BABAI: Automorphism groups, isomorphism, reconstruction; in: Handbook of Combinatorics (R. L. Graham, M. Groetschel and L. Lovasz, eds.), Elsevier, 1996.
6. L. BABAI: Randomization in group algorithms: Conceptual questions, in: Groups and Computation II (L. Finkelstein, W. M. Kantor, eds.), DIMACS Workshops on Groups and Computation, AMS, Providence, 1997.
7. L. BABAI and G. L. HETYEI: On the diameter of random Cayley graphs of the symmetric group, Combin. Probab. Comput. 1 (1992), 201-208.
8. st IEEE FOCS, 1990, pp. 857-865.
9. L. BABAI, W. M. KANTOR and A. LUBOTZKY: Small-diameter Cayley graphs for finite simple groups, European J. Combin. 10 (1989), 507-522.
10. th ACM-SIAM Symposium on Discrete Algorithms, 2000, pp. 627-635.
11. A. BOREL: Linear Algebraic Groups, (Second edition), Springer, 1991.
12. F. CELLER, C. R. LEEDHAM-GREEN, S. MURRAY, A. NIEMEYER and E. A. O'BRIEN: Generating random elements of a finite group, Comm. Algebra 23 (1995), 4931-4948.
13. F. R. K. CHUNG: Spectral Graph Theory, AMS, Providence, RI, 1994.
14. F. R. K. CHUNG and R. L. GRAHAM: Random walks on generating sets for finite groups, Electronic J. of Comb. 4:2 (1997), #R7.
15. F. R. K. CHUNG and P. TETALI: Isoperimetric inequalities for cartesian products of graphs, Combin. Probab. Comput 7 (1998), 141-148.
16. M. CULLER and K. VOGTMANN: A group theoretic criterion for property FA, Proc. Amer. Math. Soc. 124 (1996), 677-683.
17. G. DAVIDOFF, P. SARNAK and A. VALETTE: Elementary number theory, group theory, and Ramanujan graphs; Cambridge University Press, Cambridge, 2003.
18. P. DIACONIS: Group Representations in Probability and Statistics, IMS, Hayward, California, 1988.
19. P. DIACONIS and L. SALOFF-COSTE: Comarison techniques for random walk on finite groups, Annals of Probability 21 (1993), 2131-2156.
20. P. DIACONIS and L. SALOFF-COSTE: Walks on generating sets of abelian groups, Probability Theory and Related Fields 105 (1996), 393-421.
21. P. DIACONIS and L. SALOFF-COSTE: Walks on generating sets of groups, Invent. Math. 134 (1998), 251-199.
22. J. D. DIXON: The probability of generating the symmetric group, Math. Z. 110 (1969), 199-205.
23. th IEEE FOCS, 1979, pp. 364-370.
24. A. GAMBURD: Spectral gap for infinite index "congruence" subgroups, Israel Journal of Mathematics 127 (2002), 157-200.
25. A. GAMBURD, D. JAKOBSON and P. SARNAK: Spectra of elements in the group ring of SU(2), J. European Math. Soc. 1 (1999), 51-85.
26. R. GILMAN: Finite quotients of the automorphism group of a free group, Canad. J. Math. 29 (1977), 541-551.
27. M. GROMOV: Hyperbolic groups, Math. Sci. Res. Inst. Publ., 8, Springer, New York, 1987.
28. M. GROMOV: Spaces and Questions, GAFA Special Volume, Part I (2000), 118-161.
29. H. HALBERSTAM, H.-E. RICHERT: Sieve Methods, LMS Monographs, Academic Press, London, 1974.
30. P. HALL: The Eulerian functions of a group, Quart. J. Math. 7 (1936), 134-151.
31. C. HOUDRÉ and P. TETALI: Isoperimetric invariants for product Markov chains and graph products, preprint, Georgia Tech, 1996.
32. M. JERRUM, A. SINCLAIR: Approximating the permanent, SIAM J. Comput. 18 (1989), 1149-1178.
33. W. M. KANTOR: Some topics in asymptotic group theory, in: Groups, Combinatorics & Geometry (Durham, 1990), Cambridge Univ. Press, Cambridge, 1992, pp. 403-421.
34. W. M. KANTOR: Simple groups in computational group theory, in Proc. ICM Berlin, Vol. II (1998), pp. 77-86.
35. W. M. KANTOR, A. LUBOTZKY: The probability of generating a finite classical group, Geom. Dedicata 36 (1990), 67-87.
36. 2 over a finite field and related numerical experiments, Experimental Mathematics 1 (1992), 115-139.
37. J. LAFFERTY and D. ROCKMORE: Numerical investigation of the spectrum for certain families of Cayley graphs, DIMACS Series in Disc. Math. and Theor. Comp. Sci. 10 (1993), 63-73.
38. C. R. LEEDHAM-GREEN: personal communication.
39. M. W. LIEBECK and A. SHALEV: The probability of generating a finite simple group, Geom. Dedicata 56 (1995), 103-113.
40. M. W. LIEBECK and A. SHALEV: Simple groups, probabilistic methods, and a conjecture of Kantor and Lubotzky; J. Algebra 184 (1996), 31-57.
41. A. LUBOTZKY: Discrete Groups, Expanding Graphs and Invariant Measures; Birkhauser, Boston, 1994.
42. A. LUBOTZKY and I. PAK: The product replacement algorithm and Kazhdan's property (T), Journal of AMS 52 (2000), 5525-5561.
43. A. LUBOTZKY, R. PHILLIPS and P. SARNAK: Ramanujan graphs, Combinatorica 8 (1988), 261-277.
44. A. LUBOTZKY and B. WEISS: Groups and expanders, in: Expanding graphs (Princeton, NJ, 1992), pp. 95-109, DIMACS Ser. 10, AMS, Providence, RI, 1993.
45. W. MAGNUS, A. KARRASS and D. SOLITAR: Combinatorial group theory, Presentations of groups in terms of generators and relations; Second edition, Dover, New York, 1976.
46. G. A. MARGULIS: Explicit constructions of expanders, Problems of Information Transmission 9 (1973), 325-332.
47. G. A. MARGULIS: Explicit group theoretic constructions of combinatorial schemes, and their applications for construction of expanders and concentrators; Problems of Information Transmission 24 (1988), 39-46.
48. 3, Math. Proc. Cambridge Philos. Soc. 106 (1989), 207-213.
49. A. ODLYZKO: personal communication.
50. I. PAK: Random walks on finite groups with few random generators, Electr. J. Prob. 4 (1999), pp. 1-11.
51. I. PAK: The probability of generating a finite group, preprint, 1999.
52. I. PAK: What do we know about the product replacement algorithm?, in: Groups and Computation III (W. Kantor, A. Seress, eds.), Berlin, 2000, pp. 301-347.
53. st IEEE FOCS, 2000.
54. th ISSAC, 1999, pp. 91-96.
55. I. PAK and A. ZUK: On Kazhdan constants and mixing of random walks, Int. Math. Res. Not. 36 (2002), 1891-1905.
56. J.-J. QUISQUATER: unpublished manuscript.
57. st IEEE FOCS, 2000.
58. Y. SHALOM: Expanding graphs and invariant means, Combinatorica 17 (1997), 555-575.
59. Y. SHALOM: Expander graphs and amenable quotients, in: Emerging applications of number theory, pp. 571-581, IMA Vol. Math. Appl., 109, Springer, New York, 1999.
60. Y. SHALOM: Bounded generation and Kazhdan's property (T), Publ. Math. IHES 90 (1999), 145-168.
61. B. SURY: Bounded generation does not imply finite presentation, Comm. Algebra 25 (1997), 1673-1683.
62. J. WHISTON: Maximal independent generating sets of the symmetric group, J. Algebra 232 (2000), 255-268.
63. J. WHISTON: Ph.D. Thesis, Cambridge University, 2001.