ideshow: click “Research and Talks” from www.calstatela.edu/faculty/ ideshow: click “Research and Talks” from www.calstatela.edu/faculty/
Dec 21, 2015
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Expanders and Ramanujan Graphs
Mike Krebs
Cal State LA
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Think of a graph
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Think of a graph
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Think of a graph as acommunications network.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Two vertices can communcatedirectly with one another
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Two vertices can communcatedirectly with one another ifthey are connected by an edge.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Communication is instantaneousacross edges, but there may bedelays at vertices.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Edges are expensive.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
In this talk, we will be concernedprimarily with regular graphs.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
That is, same degree (numberof edges) at each vertex.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Goals:
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Goals:
● Keep the degree fixed
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Goals:
● Let the number of vertices go to infinity.
● Keep the degree fixed
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
● Make sure the communications networks are as good as possible.For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
● Let the number of vertices go to infinity.
Goals:
● Keep the degree fixed
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Main questions:
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Main questions:
How do we measure how gooda graph is as a communicationsnetwork?
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
How good can we make them?
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
How do we measure how gooda graph is as a communicationsnetwork?
Main questions:
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
RR
UU
XX
ZZ
SS
TT VV
WW
YYQQ
Here are two graphs. Each has 10 vertices. Each has degree 4.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Here are two graphs. Each has 10 vertices. Each has degree 4.
Which one is a better communications network, and why?
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
RR
UU
XX
ZZ
SS
TT VV
WW
YYQQ
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
I like the one on the right better.
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
RR
UU
XX
ZZ
SS
TT VV
WW
YYQQ
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
You can get from any vertex to any other vertex in two steps.
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
RR
UU
XX
ZZ
SS
TT VV
WW
YYQQ
I like the one on the right better.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
RR
UU
XX
ZZ
SS
TT VV
WW
YYQQ
In the graph on the left, it takes at least three steps to get fromA to F.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
Let’s look at the set of vertices we can get to in n steps.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Here’s where we can get to in one step.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Here’s where we can get to in one step.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
We would like to have many edges going outward from there.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
Here’s where we can get to in two steps.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
CC
AA
II
HH
GG
FF
EE
DD
BBJJ
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Take-home Message #1:
The expansion constantis one measure of howgood a graph is as acommunications network.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
We want h(X) to be BIG!
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
We want h(X) to be BIG!
If a graph has small degreebut many vertices, this is noteasy.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Consider cycle graphs.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Consider cycle graphs.They are 2-regular.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Consider cycle graphs.They are 2-regular.Number of vertices goes toinfinity.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Let’s see what happens tothe expansion constants.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Let S be the “bottom half” . . .
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
We say that a sequence ofregular graphs is an expanderfamily if:
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
We say that a sequence ofregular graphs is an expanderfamily if:
(A) They all have the same degree.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
We say that a sequence ofregular graphs is an expanderfamily if:
(A) They all have the same degree.
(2) The number of vertices goes to infinity.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
(iii) There exists a positive lower bound r such that the expansion constant is always at least r.
We say that a sequence ofregular graphs is an expanderfamily if:
(A) They all have the same degree.
(2) The number of vertices goes to infinity.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Expander families of degree 2 do not exist,as we just saw.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Expander families of degree 2 do not exist,as we just saw.
Amazing fact: if d is any integer greaterthen 2, then an expander family of degreed exists.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Expander families of degree 2 do not exist,as we just saw.
Amazing fact: if d is any integer greaterthen 2, then an expander family of degreed exists. (Constructing them explicitlyis highly nontrivial!)
Existence: Pinsker 1973First explicit construction: Margulis 1973
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
So far, we’ve looked at expansion froma combinatorial point of view.
Now let’s look at it from an algebraic pointof view.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
We form theadjacency matrixof a graph as follows:
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
The expansion constant of a graph isclosely related to the eigenvalues ofits adjacency matrix.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Facts about eigenvalues of a d-regulargraph G:
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Facts about eigenvalues of a d-regulargraph G:
● They are all real.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Facts about eigenvalues of a d-regulargraph G:
● They are all real.
● The largest eigenvalue is d.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
● If
Facts about eigenvalues of a d-regulargraph G:
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
is the second largest eigenvalue, then
(Alon-Dodziuk-Milman-Tanner)
● They are all real.
● The largest eigenvalue is d.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
(Alon-Dodziuk-Milman-Tanner)
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
(Alon-Dodziuk-Milman-Tanner)
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
(Alon-Dodziuk-Milman-Tanner)
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Take-home Message #1: The expansion constant is onemeasure of how good a graph is as a communications network.
Take-home Message #2:
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs
Take-home Message #1: The expansion constant is onemeasure of how good a graph is as a communications network.
For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebsFor slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebs