Random Cayley Graphs with O(log[G]) Generators Are Expanders

@inproceedings{Pak1999RandomCG,
  title={Random Cayley Graphs with O(log[G]) Generators Are Expanders},
  author={Igor Pak},
  booktitle={ESA},
  year={1999}
}
Let G be a finite group. Choose a set S of sizek uniformly from G and consider a lazy random walk on the corresponding Cayley graph Γ (G,S). We show that for almost all choices of S givenk = 2a log2 |G|, a > 1, we have Reλ1 ≤ 1−1/2a. A similar but weaker result was obtained earlier by Alon and Roichman (see [4]). 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Roichman : On random random walks

Y.
Ann . Prob . • 1999

Fill:Reversible Markov Chains and Random Walks on Graphs monograph in preparation

J. D. Aldous
1996

Hall : Probabilistic methods in group theory

R. R.
Ann . Prob . • 1996

Random random walks on Z d 2 , Prob

D. Wilson
Th . Rel . Fields • 1996

Roichman:Random Cayley graphs and expanders

Y. N. Alon
Rand. Str • 1994
View 2 Excerpts

Representations in Probability and Statistics

P. DiaconisGroup
1988

Diaconis: Strong uniform times and finite random walks

P. D. Aldous
Adv. Appl • 1987
View 1 Excerpt

Diaconis: Shuffling cards and stopping times

P. D. Aldous
Amer. Math • 1986
View 1 Excerpt

Hall:Probabilistic methods in group theory. II

R.R.P. Erd os
Houston J. Math., • 1976

Similar Papers

Loading similar papers…