University of Cambridge > > Combinatorics Seminar > Ramanujan Graphs and Finite Free Convolutions of Polynomials

Ramanujan Graphs and Finite Free Convolutions of Polynomials

Add to your list(s) Download to your calendar using vCal

  • UserDan Spielman (Yale University)
  • ClockTuesday 02 June 2015, 14:30-15:30
  • HouseMR14.

If you have a question about this talk, please contact Andrew Thomason.

We use the method of interlacing polynomials and a finite dimensional approach to free probability to prove the existence of bipartite Ramanujan graphs of every degree and number of vertices. No prior knowledge of Ramanujan graphs or free probability will be assumed.

Ramanujan graphs are defined in terms of the eigenvalues of their adjacency or Laplacian matrices. In this spectral perspective, they are the best possible expanders. Infinite families of Ramanujan graphs were first shown to exist by Margulis and Lubotzky, Phillips and Sarnak using Deligne’s proof of the Ramanujan conjecture. These constructions were sporadic, only producing graphs of special degrees and numbers of vertices.

In this talk, we outline an elementary proof of the existence of bipartite Ramanujan graphs of very degree and number of vertices. We do this by considering the expected characteristic polynomial of a random d-regular graph. We develop finite analogs of results in free probability to compute this polynomial and to bound its roots. By proving that this polynomial is the average of polynomials in an interlacing family, we then prove there exists a graph in the distribution whose eigenvalues satisfy the Ramanujan bound.

These results are joint work with Adam Marcus and Nikhil Srivastava.

This talk is part of the Combinatorics Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2017, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity