Skip to Main content Skip to Navigation
Journal articles

Improved Expansion of Random Cayley Graphs

Abstract : 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 graph with respect to c(ε ) log |G| random elements is less than ε . We reduce the number of elements to c(ε )log D(G) (for the same c), where D(G) is the sum of the dimensions of the irreducible representations of G. In sufficiently non-abelian families of groups (as measured by these dimensions), log D(G) is asymptotically (1/2)log|G|. As is well known, a small eigenvalue implies large graph expansion (and conversely); see Tanner84 and AlonMilman84-2,AlonMilman84-1. For any specified eigenvalue or expansion, therefore, random Cayley graphs (of sufficiently non-abelian groups) require only half as many edges as was previously known.
Document type :
Journal articles
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-00959024
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 5:06:48 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:24 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:15:57 PM

File

dm060222.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00959024, version 1

Collections

Citation

Po-Shen Loh, Leonard J. Schulman. Improved Expansion of Random Cayley Graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.523-528. ⟨hal-00959024⟩

Share

Metrics

Record views

144

Files downloads

743