72 citations · 174 across the 24 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
math.CO2015
Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes
Adam W. Marcus, Nikhil Srivastava, Daniel A. Spielman
We prove that there exist bipartite Ramanujan graphs of every degree and every number of vertices. The proof is based on analyzing the expected characteristic polynomial of a union…
math.CO2015
Finite free convolutions of polynomials
Adam Marcus, Daniel A. Spielman, Nikhil Srivastava
We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of…