Improved Expansion of Random Cayley Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2004

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 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.
Fichier principal
Vignette du fichier
dm060222.pdf (49.48 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00959024 , version 1 (13-03-2014)



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


93 View
789 Download



Gmail Facebook Twitter LinkedIn More