Random Cayley graphs are expanders: A simple proof of the Alon-Roichman theorem

Electronic Journal of Combinatorics

Volumn 11, Issue 1 R, 2004, Pages 1-6

  Landau, Zeph ^a   Russell, Alexander ^b  

^a CITY COLLEGE OF NEW YORK   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 5344256280     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (7)

1. Rudolf Ahlswede and Andreas Winter. Strong converse for identification via quantum channels. Technical Report quant-ph/0012127v2, quant-ph e-Print archive, 2001.
2. Noga Alon. Eigenvalues and expanders. Combinatorica, 6:83-96, 1986.
3. Noga Alon and Vitali D. Milman. Eigenvalues, expanders and superconcentrators (extended abstract). In 25th Annual Symposium on Foundations of Computer Science, pages 320-322, Singer Island, Florida, 24-26 October 1984. IEEE.
4. Noga Alon and Yuval Roichman. Random Cayley graphs and expanders. Random Structures and Algorithms, 5:271-284, 1994.
5. Noga Alon and Joel H. Spencer. The Probabilistic Method. John Wiley & Sons, Inc., 1992.
6. Po-Shen Loh and Leonard Schulman. Improved expansion of random cayley graphs. 2004.
7. Jean-Pierre Serre. Linear Representations of Finite Groups. Springer-Verlag, 1977.