Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from www.calstatela.edu/faculty/mkrebswww.calstatela.edu/faculty/mkrebs.

Slides:



Advertisements
Similar presentations
The Weizmann Institute
Advertisements

Vertex cover might be hard to approximate within 2 - ε Subhash Khot, Oded Regev Slides by: Ofer Neiman.
On the Density of a Graph and its Blowup Raphael Yuster Joint work with Asaf Shapira.
Some Graph Problems. LINIAL’S CONJECTURE Backgound: In a partially ordered set we have Dilworth’s Theorem; The largest size of an independent set (completely.
What are primes in graphs and how many of them have a given length? Audrey Terras Math. Club Oct. 30, 2008.
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
Section 1.7: Coloring Graphs
4.1 Extreme Values for a function Absolute Extreme Values (a)There is an absolute maximum value at x = c iff f(c)  f(x) for all x in the entire domain.
Curve sketching This PowerPoint presentation shows the different stages involved in sketching the graph.
Symmetric Groups and Ramanujan Graphs Mike Krebs, Cal State LA (joint work with A. Shaheen)
(Omer Reingold, 2005) Speaker: Roii Werner TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A AA A A A A AA A.
CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.
Undirected ST-Connectivity 2 DL Omer Reingold, STOC 2005: Presented by: Fenghui Zhang CPSC 637 – paper presentation.
Graphs and Trees This handout: Trees Minimum Spanning Tree Problem.
INTEGRALS 5. INTEGRALS We saw in Section 5.1 that a limit of the form arises when we compute an area.  We also saw that it arises when we try to find.
EXPANDER GRAPHS Properties & Applications. Things to cover ! Definitions Properties Combinatorial, Spectral properties Constructions “Explicit” constructions.
For slideshow: click “Research and Talks” from slideshow: click “Research and Talks”
Zig-Zag Expanders Seminar in Theory and Algorithmic Research Sashka Davis UCSD, April 2005 “ Entropy Waves, the Zig-Zag Graph Product, and New Constant-
Expanders Eliyahu Kiperwasser. What is it? Expanders are graphs with no small cuts. The later gives several unique traits to such graph, such as: – High.
For slideshow: click “Research and Talks” from slideshow: click “Research and Talks”
Undirected ST-Connectivity In Log Space
The (Degree, Diameter) Problem By Whitney Sherman.
Undirected ST-Connectivity In Log Space Omer Reingold Slides by Sharon Bruckner.
For slideshow: click “Research and Talks” from slideshow: click “Research and Talks”
Curve sketching This PowerPoint presentation shows the different stages involved in sketching the graph.
Graphing Reciprocal Functions Reciprocal of a Linear Function y = x.
3208 Unit 2 Limits and Continuity
Applications of Differentiation Curve Sketching. Why do we need this? The analysis of graphs involves looking at “interesting” points and intervals and.
Infinite Limits and Limits to Infinity: Horizontal and Vertical Asymptotes.
Copyright © Cengage Learning. All rights reserved. 3 Applications of Differentiation.
An introduction to expander families and Ramanujan graphs
Cryptographic hash functions from expander graphs Denis Charles, Microsoft Research Eyal Goren, McGill University Kristin Lauter, Microsoft Research ECC.
Algebra of Limits Assume that both of the following limits exist and c and is a real number: Then:
Excel quad iteration M-set iterator Movie maker 75.
Copyright © 2014, 2010 Pearson Education, Inc. Chapter 2 Polynomials and Rational Functions Copyright © 2014, 2010 Pearson Education, Inc.
Many times we are concerned with the “end behavior” of a function. That is, what does a function do as x approaches infinity. This becomes very important.
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Expanders via Random Spanning Trees R 許榮財 R 黃佳婷 R 黃怡嘉.
Copyright © Cengage Learning. All rights reserved. 2 Limits and Derivatives.
2.2 Limits Involving Infinity Goals: Use a table to find limits to infinity, use the sandwich theorem, use graphs to determine limits to infinity, find.
Maximum density of copies of a graph in the n-cube John Goldwasser Ryan Hansen West Virginia University.
15-853:Algorithms in the Real World
Section 4.3 The Logarithmic Function. Recall the definition of log In your groups see if you can draw the graph of log (without the aid of a calculator!!!)
Exercises Graph the following functions. Solutions will follow the exercises.
Artur Czumaj DIMAP DIMAP (Centre for Discrete Maths and it Applications) Computer Science & Department of Computer Science University of Warwick Testing.
CHapter1 Section 2 Functions and their properties.
INTEGRALS We saw in Section 5.1 that a limit of the form arises when we compute an area. We also saw that it arises when we try to find the distance traveled.
5 INTEGRALS.
Graphs, Vectors, and Matrices Daniel A. Spielman Yale University AMS Josiah Willard Gibbs Lecture January 6, 2016.
Presented by Alon Levin
NOTE: To change the image on this slide, select the picture and delete it. Then click the Pictures icon in the placeholder to insert your own image. Fast.
Spanning Tree Definition:A tree T is a spanning tree of a graph G if T is a subgraph of G that contains all of the vertices of G. A graph may have more.
Limits Involving Infinity Section 1.4. Infinite Limits A limit in which f(x) increases or decreases without bound as x approaches c is called an infinite.
Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from
Curve sketching This PowerPoint presentation shows the different stages involved in sketching the graph.
The isoperimetric constant of a Generalized Paley graph
Degree and Eigenvector Centrality
Curve sketching This PowerPoint presentation shows the different stages involved in sketching the graph.
3.5: ASYMPTOTES.
Curve sketching This PowerPoint presentation shows the different stages involved in sketching the graph.
Drawing Quadratic Curves
On the effect of randomness on planted 3-coloring models
Radical Functions Essential Questions
What LIMIT Means Given a function: f(x) = 3x – 5 Describe its parts.
Comparing and Ordering Integers
More Properties of Functions
Interpreting Graphs.
In symbol, we write this as
Graphs G = (V, E) V are the vertices; E are the edges.
EQ: How do we construct dot plots and histograms
Presentation transcript:

Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from

For slideshow: click “Research and Talks” from A graph is a collection of vertices (dots) and edges (connections between vertices).

For slideshow: click “Research and Talks” from Distances don’t matter. All we care about is how the vertices are connected. These two graphs are the same, for example

For slideshow: click “Research and Talks” from Distances don’t matter. All we care about is how the vertices are connected. These two graphs are the same, for example

For slideshow: click “Research and Talks” from Consider the graph below.

For slideshow: click “Research and Talks” from The blue vertex below has degree 4.

For slideshow: click “Research and Talks” from The red vertex has degree 2.

For slideshow: click “Research and Talks” from So this graph is not “regular.”

For slideshow: click “Research and Talks” from Is this graph regular?

For slideshow: click “Research and Talks” from Yes, every vertex has degree 3.

For slideshow: click “Research and Talks” from We say it is 3-regular.

For slideshow: click “Research and Talks” from In this talk, we will be concerned primarily with regular graphs.

For slideshow: click “Research and Talks” from Think of a graph as a communications network. Two vertices can communcate directly with one another if they are connected by an edge.

For slideshow: click “Research and Talks” from Communication is instantaneous across edges, but there may be delays at vertices. Edges are expensive.

For slideshow: click “Research and Talks” from Goals: - Keep the degree fixed. - Let the number of vertices go to infinity. - Make sure the communications networks are “good.”

For slideshow: click “Research and Talks” from Main questions: How do we measure how good a graph is as a communications network? How good can we make them?

For slideshow: click “Research and Talks” from CAI H G F E D B J R U XZS TV W Y Q Here are two graphs. Each has 10 vertices. Each has degree 4.

For slideshow: click “Research and Talks” from Here are two graphs. Each has 10 vertices. Each has degree 4. Which one is a better communications network, and why? CAI H G F E D B J R U XZS TV W Y Q

For slideshow: click “Research and Talks” from I like the one on the right better. CAI H G F E D B J R U XZS TV W Y Q

For slideshow: click “Research and Talks” from You can get from any vertex to any other vertex in two steps. CAI H G F E D B J R U XZS TV W Y Q I like the one on the right better.

For slideshow: click “Research and Talks” from CAI H G F E D B J R U XZS TV W Y Q In the graph on the left, it takes at least three steps to get from A to F.

For slideshow: click “Research and Talks” from CAI H G F E D B J Let’s look at the set of vertices we can get to in n steps.

For slideshow: click “Research and Talks” from CAI H G F E D B J Let’s look at the set of vertices we can get to in n steps.

For slideshow: click “Research and Talks” from CAI H G F E D B J Here’s where we can get to in one step.

For slideshow: click “Research and Talks” from CAI H G F E D B J We would like to have many edges going outward from there.

For slideshow: click “Research and Talks” from CAI H G F E D B J Here’s where we can get to in two steps.

For slideshow: click “Research and Talks” from For any set S of vertices, we would like to have many edges from S to its complement.

For slideshow: click “Research and Talks” from CAI H G F E D B J The set of edges from S to its complement is called the boundary of S, denoted dS. Example: |S| = 5 |dS| = 6

For slideshow: click “Research and Talks” from Let G be a graph. Define h(G) to be the minimum value of over all sets S containing no more than half the vertices.

For slideshow: click “Research and Talks” from h(G) is called the expansion constant of G.

For slideshow: click “Research and Talks” from Example:

For slideshow: click “Research and Talks” from Example: = 2/1= 2

For slideshow: click “Research and Talks” from Example: = 2/2= 1

For slideshow: click “Research and Talks” from Example: = 4/2= 2

For slideshow: click “Research and Talks” from Example: 2/2=1 was the min. So h(X)=1.

For slideshow: click “Research and Talks” from The expansion constant tells us that even in a worst case, for any small set S, we have at least h(X)|S| edges going from S to its complement.

For slideshow: click “Research and Talks” from We want h(X) to be BIG! If a graph has small degree but many vertices, this is not easy.

For slideshow: click “Research and Talks” from Consider cycle graphs. They are 2-regular. Number of vertices goes to infinity.

For slideshow: click “Research and Talks” from Let’s see what happens to the expansion constants.

For slideshow: click “Research and Talks” from Let C be a cycle graph with n vertices.

For slideshow: click “Research and Talks” from Choose S to be the “bottom half.”

For slideshow: click “Research and Talks” from So S has n/2 or (n-1)/2 vertices.

For slideshow: click “Research and Talks” from But |dS|=2.

For slideshow: click “Research and Talks” from So h(C)<2/[(n-1)/2]=n-10

For slideshow: click “Research and Talks” from We say that a sequence of regular graphs is an expander family if:

For slideshow: click “Research and Talks” from We say that a sequence of regular graphs is an expander family if: (A) They all have the same degree.

For slideshow: click “Research and Talks” from We say that a sequence of regular graphs is an expander family if: (A) They all have the same degree. (2) The number of vertices goes to infinity.

For slideshow: click “Research and Talks” from We say that a sequence of regular graphs is an expander family if: (A) They all have the same degree. (2) The number of vertices goes to infinity. (iii) There exists a positive lower bound r such that the expansion constant is always at least r.

For slideshow: click “Research and Talks” from Expander families of degree 2 do not exist, as we just saw.

For slideshow: click “Research and Talks” from Expander families of degree 2 do not exist, as we just saw. Amazing fact: if d is any integer greater then 2, then an expander family of degree d exists.

For slideshow: click “Research and Talks” from Expander families of degree 2 do not exist, as we just saw. Amazing fact: if d is any integer greater then 2, then an expander family of degree d exists. (Constructing them is highly nontrivial!)

For slideshow: click “Research and Talks” from So far, we’ve looked at expansion from a combinatorial point of view. Now let’s look at it from an algebraic point of view.

We form the adjacency matrix of a graph as follows:

For slideshow: click “Research and Talks” from The expansion constant of a graph is closely related to the eigenvalues of its adjacency matrix.

For slideshow: click “Research and Talks” from Facts about graph eigenvalues:

For slideshow: click “Research and Talks” from Facts about graph eigenvalues: - the eigenvalues of a graph are all real

For slideshow: click “Research and Talks” from Facts about graph eigenvalues: - the eigenvalues of a graph are all real - the largest eigenvalue of a d-regular graph is d

For slideshow: click “Research and Talks” from Facts about graph eigenvalues: - the eigenvalues of a graph are all real - the largest eigenvalue of a d-regular graph is d - ifis the second largest eigenvalue, then

For slideshow: click “Research and Talks” from We call d-the spectral gap of the graph. h(G) is big iff the spectral gap is big.

For slideshow: click “Research and Talks” from A sequence of regular graphs is an expander family if: (A) They all have the same degree. (2) The number of vertices goes to infinity. (iii) There exists a positive lower bound r such that the spectral gap is always at least r.

For slideshow: click “Research and Talks” from We call d-the spectral gap of the graph. So we want the spectral gap to be big. So we wantto be small. But there is a limit to how small it can be.

For slideshow: click “Research and Talks” from must lie above the red curve.

For slideshow: click “Research and Talks” from at. The red curve had a horizontal asymptote

For slideshow: click “Research and Talks” from In other words, can be. at. is essentially the smallest The red curve had a horizontal asymptote

For slideshow: click “Research and Talks” from In other words, can be. at. is essentially the smallest We say a graph is Ramanujan if: < The red curve had a horizontal asymptote

For slideshow: click “Research and Talks” from Known: There exists a family of d-regular Ramanujan graphs if d-1 is a prime power.

For slideshow: click “Research and Talks” from Known: There exists a family of d-regular Ramanujan graphs if d-1 is a prime power. Open problem: Does a family of d-regular Ramanujan graphs for all d >3?