BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Daniel Spielman (Yale)
DTSTART:20210319T173000Z
DTEND:20210319T183000Z
DTSTAMP:20260423T020958Z
UID:WCS/23
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/23/">Fin
 ite Free Probability and Ramanujan Graphs</a>\nby Daniel Spielman (Yale) a
 s part of Warwick Combinatorics Seminar\n\n\nAbstract\nWe introduce a fini
 te analog of Voiculescu's Free Probability that allows us to compute the e
 xpected characteristic polynomials of certain random matrices and to prove
  bounds on the locations of the roots of those polynomials. We sketch how 
 this theory may be used to prove that there exist bipartite Ramanujan grap
 hs of every degree and number of vertices.\n\nNo prior knowledge of free p
 robability or Ramanujan graphs will be assumed.\n\nThis is joint work with
  Adam Marcus and Nikhil Srivastava.\n
LOCATION:https://researchseminars.org/talk/WCS/23/
END:VEVENT
END:VCALENDAR