Geodesic
Improved Expansion of Random Cayley Graphs
Discrete mathematics & theoretical computer science, Tome 6 (2003-2004) no. 2.

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2004_6_2_a7,
     author = {Loh, Po-Shen and Schulman, Leonard J.},
     title = {Improved {Expansion} of {Random} {Cayley} {Graphs}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {6},
     number = {2},
     year = {2003-2004},
     doi = {10.46298/dmtcs.316},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.316/}
}
TY  - JOUR
AU  - Loh, Po-Shen
AU  - Schulman, Leonard J.
TI  - Improved Expansion of Random Cayley Graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2003-2004
VL  - 6
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.316/
DO  - 10.46298/dmtcs.316
LA  - en
ID  - DMTCS_2004_6_2_a7
ER  - 
%0 Journal Article
%A Loh, Po-Shen
%A Schulman, Leonard J.
%T Improved Expansion of Random Cayley Graphs
%J Discrete mathematics & theoretical computer science
%D 2003-2004
%V 6
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.316/
%R 10.46298/dmtcs.316
%G en
%F DMTCS_2004_6_2_a7
Loh, Po-Shen; Schulman, Leonard J. Improved Expansion of Random Cayley Graphs. Discrete mathematics & theoretical computer science, Tome 6 (2003-2004) no. 2. doi : 10.46298/dmtcs.316. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.316/

Cité par Sources :