BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Spectral Sparsification of Graphs - Nikhil Srivastava (University 
 of California\, Berkeley)
DTSTART:20160712T100000Z
DTEND:20160712T103000Z
UID:TALK66712@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:Modern graph algorithms increasingly access and manipulate gra
 phs via their Laplacian operators and other associated &ldquo\;continuous&
 rdquo\; objects\, rather than purely discretely. &nbsp\;An important primi
 tive in this paradigm is spectral sparsification: being able to approximat
 e the Laplacian of a given graph by that of a graph with significantly few
 er edges. I will survey some of the key results in this area\, drawing on 
 tools from random matrix theory\, matrix analysis\, and electrical network
  theory.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR