Random cayley graphs with О (Log |GA|) generators are expanders

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1643, Issue , 1999, Pages 521-526

  Pak, Igor ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CAYLEY GRAPHS; FINITE GROUPS; RANDOM WALK;

GRAPH THEORY;

EID: 67650530223     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48481-7_45     Document Type: Conference Paper

References (14)

1. D. Aldous, P. Diaconis: Shuffling cards and stopping times, Amer. Math. Monthly, 93 1986, pp 333-348.
2. D. Aldous, P. Diaconis: Strong uniform times and finite random walks, Adv. Appl. Math., 8 1987, pp 69-97.
3. D. Aldous, J. Fill: Reversible Markov Chains and Random Walks on Graphs monograph in preparation1996.
4. N. Alon, Y. Roichman: Random Cayley graphs and expanders, Rand. Str. Alg., 5 1994, pp 271-284.
5. rd ACM STOC 1991, pp 164-174.
6. L. Babai: Automorphismgroups, isomorphism, reconstruction, in HandbookofCombinatorics (R. L. Graham et al., eds.), Elsevier 1996.
7. P. Diaconis: Group Representations in Probability and Statistics, IMS, Hayward, California 1988.
8. C. Dou, M. Hildebrand: Enumerationandrandomrandom walkson finitegroups, Ann. Prob., 24 1996, pp 987-1000.
9. P. Erdos, R.R. Hall: Probabilistic methods in group theory. II, Houston J. Math., 2 1976, pp 173-180.
10. P. Erdös, A. Renyi: Probabilistic methods in group theory, Jour. Analyse Mathematique, 14 1965, pp 127-138.
11. I. Pak: Random walks on groups: strong uniform time approach, Ph.D. Thesis, Harvard U. 1997.
12. I. Pak: Random walks on finite groups with few random generators, Electronic J. Prob., 4 1999, pp 1-11.
13. Y. Roichman: On random random walks, Ann. Prob.,24 1996, pp 1001-1011.
14. 2, Prob. Th. Rel. Fields, 108 1997, pp 441-457.