Improved Expansion of Random Cayley Graphs
In Random Cayley Graphs and Expanders, N. Alon and Y. Roichman proved that for every ε > 0 there is a finite c(ε) such that for any sufficiently large group G, the expected value of the second largest (in absolute value) eigenvalue of the normalized adjacency matrix of the Cayley grap...
Main Authors: | Po-Shen Loh, Leonard J. Schulman |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2004-12-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/205 |
Similar Items
-
Improved Expansion of Random Cayley Graphs
by: Po-Shen Loh, et al.
Published: (2004-01-01) -
On the chromatic number of random Cayley graphs
by: Green, B
Published: (2016) -
Quasirandom Cayley graphs
by: Conlon, D, et al.
Published: (2017) -
Rainbow Tetrahedra in Cayley Graphs
by: Dejter Italo J.
Published: (2015-11-01) -
Random walks on Cayley graphs of complex reflection groups
by: Maksim M. Vaskouski
Published: (2021-11-01)