Ramanujan Graphs of Every Degree Adam Marcus (Crisply, Yale) Daniel Spielman (Yale) Nikhil Srivastava (MSR India)

Slides:



Advertisements
Similar presentations
The Cover Time of Random Walks Uriel Feige Weizmann Institute.
Advertisements

Great Theoretical Ideas in Computer Science
The Solution of the Kadison-Singer Problem Adam Marcus (Crisply, Yale) Daniel Spielman (Yale) Nikhil Srivastava (MSR/Berkeley) IAS, Nov 5, 2014.
1 Decomposing Hypergraphs with Hypertrees Raphael Yuster University of Haifa - Oranim.
Chapter 9 Graphs.
Approximation, Chance and Networks Lecture Notes BISS 2005, Bertinoro March Alessandro Panconesi University La Sapienza of Rome.
1 Counting Perfect Matchings of a Graph It is hard in general to count the number of perfect matchings in a graph. But for planar graphs it can be done.
CompSci 102 Discrete Math for Computer Science April 19, 2012 Prof. Rodger Lecture adapted from Bruce Maggs/Lecture developed at Carnegie Mellon, primarily.
GOLOMB RULERS AND GRACEFUL GRAPHS
Approximation Algorithms for Unique Games Luca Trevisan Slides by Avi Eyal.
Noga Alon Institute for Advanced Study and Tel Aviv University
Lecture 17 Introduction to Eigenvalue Problems
On the Spread of Viruses on the Internet Noam Berger Joint work with C. Borgs, J.T. Chayes and A. Saberi.
Random Walks Ben Hescott CS591a1 November 18, 2002.
Last time: terminology reminder w Simple graph Vertex = node Edge Degree Weight Neighbours Complete Dual Bipartite Planar Cycle Tree Path Circuit Components.
Symmetric Groups and Ramanujan Graphs Mike Krebs, Cal State LA (joint work with A. Shaheen)
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
EXPANDER GRAPHS Properties & Applications. Things to cover ! Definitions Properties Combinatorial, Spectral properties Constructions “Explicit” constructions.
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.
Linear-Time Encodable and Decodable Error-Correcting Codes Jed Liu 3 March 2003.
Undirected ST-Connectivity In Log Space Omer Reingold Slides by Sharon Bruckner.
CS 290H Lecture 17 Dulmage-Mendelsohn Theory
1 Entropy Waves, The Zigzag Graph Product, and New Constant-Degree Expanders Omer Reingold Salil Vadhan Avi Wigderson Lecturer: Oded Levy.
What is the Riemann Hypothesis for Zeta Functions of Irregular Graphs? Audrey Terras UCLA, IPAM February, 2008 Joint work with H. M. Stark, M. D. Horton,
The Erdös-Rényi models
GRAPH Learning Outcomes Students should be able to:
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
Approximating the MST Weight in Sublinear Time Bernard Chazelle (Princeton) Ronitt Rubinfeld (NEC) Luca Trevisan (U.C. Berkeley)
Kernel Bounds for Structural Parameterizations of Pathwidth Bart M. P. Jansen Joint work with Hans L. Bodlaender & Stefan Kratsch July 6th 2012, SWAT 2012,
Cryptographic hash functions from expander graphs Denis Charles, Microsoft Research Eyal Goren, McGill University Kristin Lauter, Microsoft Research ECC.
1 Universality, Tolerance, Chaos and Order Noga Alon, Tel Aviv University Szemerédi’s Conference Budapest, August 2010.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Chapter 9 (Part 2): Graphs  Graph Terminology (9.2)
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Expanders via Random Spanning Trees R 許榮財 R 黃佳婷 R 黃怡嘉.
1 CS104 : Discrete Structures Chapter V Graph Theory.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
Convergent sequences of sparse graphs (status report) László Lovász Eötvös University, Budapest.
Week 11 - Monday.  What did we talk about last time?  Binomial theorem and Pascal's triangle  Conditional probability  Bayes’ theorem.
15-853:Algorithms in the Real World
Graph Colouring L09: Oct 10. This Lecture Graph coloring is another important problem in graph theory. It also has many applications, including the famous.
Chapter 1 Fundamental Concepts Introduction to Graph Theory Douglas B. West July 11, 2002.
Artur Czumaj DIMAP DIMAP (Centre for Discrete Maths and it Applications) Computer Science & Department of Computer Science University of Warwick Testing.
Graphs, Vectors, and Matrices Daniel A. Spielman Yale University AMS Josiah Willard Gibbs Lecture January 6, 2016.
Complexity and Efficient Algorithms Group / Department of Computer Science Testing the Cluster Structure of Graphs Christian Sohler joint work with Artur.
geometric representations of graphs
COMMUNITY DETECTION IN STOCHASTIC BLOCK MODELS VIA SPECTRAL METHODS Laurent Massoulié (MSR-Inria Joint Centre, Inria)
Great Theoretical Ideas in Computer Science for Some.
Presented by Alon Levin
COMPSCI 102 Introduction to Discrete Mathematics.
Symmetric-pattern multifrontal factorization T(A) G(A)
Week 11 - Wednesday.  What did we talk about last time?  Graphs  Paths and circuits.
1 GRAPH Learning Outcomes Students should be able to: Explain basic terminology of a graph Identify Euler and Hamiltonian cycle Represent graphs using.
An algorithmic proof of the Lovasz Local Lemma via resampling oracles Jan Vondrak IBM Almaden TexPoint fonts used in EMF. Read the TexPoint manual before.
1 Entropy Waves, The Zigzag Graph Product, and New Constant-Degree Expanders Omer Reingold Salil Vadhan Avi Wigderson Lecturer: Oded Levy.
Laplacian Matrices of Graphs: Algorithms and Applications ICML, June 21, 2016 Daniel A. Spielman.
Laplacian Matrices of Graphs: Algorithms and Applications ICML, June 21, 2016 Daniel A. Spielman.
Theory of Computational Complexity Probability and Computing Chapter Hikaru Inada Iwama and Ito lab M1.
Coding, Complexity and Sparsity workshop
Great Theoretical Ideas In Computer Science
Introduction to Trees Section 11.1.
Complexity of Expander-Based Reasoning and the Power of Monotone Proofs Sam Buss (UCSD), Valentine Kabanets (SFU), Antonina Kolokolova.
Deterministic Gossiping
Great Ideas in Computing Average Case Analysis
geometric representations of graphs
On the effect of randomness on planted 3-coloring models
Great Theoretical Ideas In Computer Science
Discrete Mathematics for Computer Science
Explicit near-Ramanujan graphs of every degree
Presentation transcript:

Ramanujan Graphs of Every Degree Adam Marcus (Crisply, Yale) Daniel Spielman (Yale) Nikhil Srivastava (MSR India)

Expander Graphs Sparse, regular well-connected graphs with many properties of random graphs. Random walks mix quickly. Every small set of vertices has many neighbors. Pseudo-random generators. Error-correcting codes. Sparse approximations of complete graphs. Major theorems in Theoretical Computer Science.

Spectral Expanders Let G be a graph and A be its adjacency matrix a c d e b Eigenvalues If d -regular (every vertex has d edges), “trivial”

Spectral Expanders If bipartite (all edges between two parts/colors) eigenvalues are symmetric about 0 “trivial” a cd f b e If d -regular and bipartite,

Spectral Expanders 0 [] -d d G is a good spectral expander if all non-trivial eigenvalues are small

Bipartite Complete Graph Adjacency matrix has rank 2, so all non-trivial eigenvalues are 0 a cd f b e

Spectral Expanders 0 [] -d d Challenge: construct infinite families of fixed degree G is a good spectral expander if all non-trivial eigenvalues are small

Spectral Expanders G is a good spectral expander if all non-trivial eigenvalues are small 0 [] -d d Challenge: construct infinite families of fixed degree Alon-Boppana ‘86: Cannot beat ) (

G is a Ramanujan Graph if absolute value of non-trivial eigs 0 [] -d d ) ( Ramanujan Graphs:

G is a Ramanujan Graph if absolute value of non-trivial eigs 0 [] -d d ) ( Ramanujan Graphs: Margulis, Lubotzky-Phillips-Sarnak’88: Infinite sequences of Ramanujan graphs exist for

G is a Ramanujan Graph if absolute value of non-trivial eigs 0 [] -d d ) ( Ramanujan Graphs: Margulis, Lubotzky-Phillips-Sarnak’88: Infinite sequences of Ramanujan graphs exist for Can be quickly constructed: can compute neighbors of a vertex from its name

G is a Ramanujan Graph if absolute value of non-trivial eigs 0 [] -d d ) ( Ramanujan Graphs: Friedman’08: A random d -regular graph is almost Ramanujan :

Ramanujan Graphs of Every Degree Theorem: there are infinite families of bipartite Ramanujan graphs of every degree.

Theorem: there are infinite families of bipartite Ramanujan graphs of every degree. And, are infinite families of (c,d) -biregular Ramanujan graphs, having non-trivial eigs bounded by Ramanujan Graphs of Every Degree

Find an operation that doubles the size of a graph without creating large eigenvalues. 0 [] -d d Bilu-Linial ‘06 Approach ( )

0 [] -d d Bilu-Linial ‘06 Approach Find an operation that doubles the size of a graph without creating large eigenvalues. ( )

2-lifts of graphs a c d e b

a c d e b a c d e b duplicate every vertex

2-lifts of graphs duplicate every vertex a0a0 c0c0 d0d0 e0e0 b0b0 a1a1 c1c1 d1d1 e1e1 b1b1

2-lifts of graphs a0a0 c0c0 d0d0 e0e0 b0b0 a1a1 d1d1 e1e1 b1b1 c1c1 for every pair of edges: leave on either side (parallel), or make both cross

2-lifts of graphs for every pair of edges: leave on either side (parallel), or make both cross a0a0 c0c0 d0d0 e0e0 b0b0 a1a1 d1d1 e1e1 b1b1 c1c1

2-lifts of graphs

2-lifts of graphs

2-lifts of graphs

Eigenvalues of 2-lifts (Bilu-Linial) Given a 2-lift of G, create a signed adjacency matrix A s with a -1 for crossing edges and a 1 for parallel edges a0a0 c0c0 d0d0 e0e0 b0b0 a1a1 d1d1 e1e1 b1b1 c1c1

Eigenvalues of 2-lifts (Bilu-Linial) Theorem: The eigenvalues of the 2-lift are the union of the eigenvalues of A (old) and the eigenvalues of A s (new) a0a0 c0c0 d0d0 e0e0 b0b0 a1a1 d1d1 e1e1 b1b1 c1c1

Eigenvalues of 2-lifts (Bilu-Linial) Conjecture: Every d -regular graph has a 2-lift in which all the new eigenvalues have absolute value at most Theorem: The eigenvalues of the 2-lift are the union of the eigenvalues of A (old) and the eigenvalues of A s (new)

Eigenvalues of 2-lifts (Bilu-Linial) Conjecture: Every d -regular graph has a 2-lift in which all the new eigenvalues have absolute value at most Would give infinite families of Ramanujan Graphs: start with the complete graph, and keep lifting.

Eigenvalues of 2-lifts (Bilu-Linial) Conjecture: Every d -regular graph has a 2-lift in which all the new eigenvalues have absolute value at most We prove this in the bipartite case. a 2-lift of a bipartite graph is bipartite

Eigenvalues of 2-lifts (Bilu-Linial) Theorem: Every d -regular graph has a 2-lift in which all the new eigenvalues have absolute value at most Trick: eigenvalues of bipartite graphs are symmetric about 0, so only need to bound largest

Eigenvalues of 2-lifts (Bilu-Linial) Theorem: Every d -regular bipartite graph has a 2-lift in which all the new eigenvalues have absolute value at most

First idea: a random 2-lift Specify a lift by Pick s uniformly at random

First idea: a random 2-lift Specify a lift by Pick s uniformly at random Are graphs for which this usually fails

First idea: a random 2-lift Specify a lift by Pick s uniformly at random Are graphs for which this usually fails Bilu and Linial proved G almost Ramanujan, implies new eigenvalues usually small. Improved by Puder and Agarwal-Kolla-Madan

The expected polynomial Consider

The expected polynomial Consider Conclude there is an s so that Prove Prove is an interlacing family

The expected polynomial Theorem (Godsil-Gutman ‘81): the matching polynomial of G

The matching polynomial (Heilmann-Lieb ‘72) m i = the number of matchings with i edges

one matching with 0 edges

7 matchings with 1 edge

Proof that x ±1 0 0 ±1 ±1 ±1 x ± ±1 x ± ±1 x ±1 0 ±1 0 0 ±1 x ±1 ± ±1 x Expand using permutations

Proof that x ±1 0 0 ±1 ±1 ±1 x ± ±1 x ± ±1 x ±1 0 ±1 0 0 ±1 x ±1 ± ±1 x Expand using permutations same edge: same value

Proof that x ±1 0 0 ±1 ±1 ±1 x ± ±1 x ± ±1 x ±1 0 ±1 0 0 ±1 x ±1 ± ±1 x Expand using permutations same edge: same value

Proof that x ±1 0 0 ±1 ±1 ±1 x ± ±1 x ± ±1 x ±1 0 ±1 0 0 ±1 x ±1 ± ±1 x Expand using permutations Get 0 if hit any 0s

Proof that x ±1 0 0 ±1 ±1 ±1 x ± ±1 x ± ±1 x ±1 0 ±1 0 0 ±1 x ±1 ± ±1 x Expand using permutations Get 0 if take just one entry for any edge

Proof that x ±1 0 0 ±1 ±1 ±1 x ± ±1 x ± ±1 x ±1 0 ±1 0 0 ±1 x ±1 ± ±1 x Expand using permutations Only permutations that count are involutions

Proof that x ±1 0 0 ±1 ±1 ±1 x ± ±1 x ± ±1 x ±1 0 ±1 0 0 ±1 x ±1 ± ±1 x Expand using permutations Only permutations that count are involutions

Proof that x ±1 0 0 ±1 ±1 ±1 x ± ±1 x ± ±1 x ±1 0 ±1 0 0 ±1 x ±1 ± ±1 x Expand using permutations Only permutations that count are involutions Correspond to matchings

The matching polynomial (Heilmann-Lieb ‘72) Theorem (Heilmann-Lieb) all the roots are real

The matching polynomial (Heilmann-Lieb ‘72) Theorem (Heilmann-Lieb) all the roots are real and have absolute value at most

The matching polynomial (Heilmann-Lieb ‘72) Theorem (Heilmann-Lieb) all the roots are real and have absolute value at most Implies

Interlacing Polynomial interlaces if

Common Interlacing and have a common interlacing if can partition the line into intervals so that each interval contains one root from each poly

Common Interlacing and have a common interlacing if can partition the line into intervals so that each interval contains one root from each poly ) ) ) ) ( (( (

If p 1 and p 2 have a common interlacing, for some i. Largest root of average Common Interlacing

If p 1 and p 2 have a common interlacing, for some i. Largest root of average Common Interlacing

is an interlacing family If the polynomials can be placed on the leaves of a tree so that when put average of descendants at nodes siblings have common interlacings Interlacing Family of Polynomials

is an interlacing family Interlacing Family of Polynomials If the polynomials can be placed on the leaves of a tree so that when put average of descendants at nodes siblings have common interlacings

Interlacing Family of Polynomials There is an s so that Theorem:

An interlacing family Theorem: Let is an interlacing family

Interlacing and have a common interlacing iff is real rooted for all

To prove interlacing family Let

To prove interlacing family Let Need to prove that for all, is real rooted

To prove interlacing family Let are fixed is 1 with probability, -1 with are uniformly Need to prove that for all, is real rooted

Generalization of Heilmann-Lieb We prove is real rooted for every independent distribution on the entries of s

Generalization of Heilmann-Lieb We prove is real rooted for every independent distribution on the entries of s By using mixed characteristic polynomials

Mixed Characteristic Polynomials For independently chosen random vectors is their mixed characteristic polynomial. Theorem: Mixed characteristic polynomials are real rooted. Proof: Using theory of real stable polynomials.

Mixed Characteristic Polynomials For independently chosen random vectors is their mixed characteristic polynomial. Obstacle: our matrix is a sum of random rank-2 matrices or

Mixed Characteristic Polynomials For independently chosen random vectors is their mixed characteristic polynomial. Solution: add to the diagonal or

Generalization of Heilmann-Lieb We prove is real rooted for every independent distribution on the entries of s Implies is an interlacing family

Generalization of Heilmann-Lieb We prove is real rooted for every independent distribution on the entries of s Conclude there is an s so that Implies is an interlacing family

Universal Covers The universal cover of a graph G is a tree T of which G is a quotient. vertices map to vertices edges map to edges homomorphism on neighborhoods Is the tree of non-backtracking walks in G. The universal cover of a d -regular graph is the infinite d -regular tree.

Quotients of Trees d -regular Ramanujan as quotient of infinite d -ary tree Spectral radius and norm of inf d -ary tree are

Godsil’s Proof of Heilmann-Lieb T(G,v) : the path tree of G at v vertices are paths in G starting at v edges to paths differing in one step

Godsil’s Proof of Heilmann-Lieb a c d e b a a b e a e a b e a b c a b d e a

T(G,v) : the path tree of G at v vertices are paths in G starting at v edges to paths differing in one step Theorem: The matching polynomial divides the characteristic polynomial of T(G,v)

Godsil’s Proof of Heilmann-Lieb T(G,v) : the path tree of G at v vertices are paths in G starting at v edges to paths differing in one step Theorem: The matching polynomial divides the characteristic polynomial of T(G,v) Is a subgraph of infinite tree, so has smaller spectral radius

Quotients of Trees (c,d) -biregular bipartite Ramanujan as quotient of infinite (c,d) -ary tree Spectral radius For (c,d) -regular bipartite Ramanujan graphs

Irregular Ramanujan Graphs (Greenberg-Lubotzky) Def: G is Ramanujan if its non-trivial eigenvalues have abs value less than the spectral radius of its cover Theorem: If G is bipartite and Ramanujan, then there is an infinite family of Ramanujan graphs with the same cover.

Questions Non-bipartite Ramanujan Graphs of every degree? Efficient constructions? Explicit constructions?