Video Lectures

Separate tags with a comma.

Ramanujan graphs of every degree

Daniel Spielman
We explain what Ramanujan graphs are, and prove that there exist infinite families of bipartite Ramanujan graphs of every degree. Our proof follows a plan suggested by Bilu and Linial, and exploits a proof of a conjecture of theirs about lifts of...
We will explain our recent solution of the Kadison-Singer Problem and the equivalent Bourgain-Tzafriri and Paving Conjectures. We will begin by introducing the method of interlacing families of polynomials and use of barrier function arguments to...
Random graphs and expander graphs can be viewed as sparse approximations of complete graphs, with Ramanujan expanders providing the best possible approximations. We formalize this notion of approximation and ask how well an arbitrary graph can be...
We introduce a new method of obtaining sharp estimates on mixing for Glauber dynamics for the Ising model, which, in particular, establishes cutoff in three dimensions up to criticality. The new framework, which considers ``information percolation''...
After Gromov's foundational work in 1985, problems of symplectic embeddings lie in the heart of symplectic geometry. The Gromov width of a symplectic manifold \((M, \omega)\) is a symplectic invariant that measures, roughly speaking, the size of the...