BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:User-Friendly Tail Bounds for Sums of Random Matrices
DTSTART:20110624T110000
DTSTAMP:20260513T173715Z
UID:fc136c220d2616af8dde973afc58d97051de98825474060a83748fd0
CATEGORIES:Conferences - Seminars
DESCRIPTION:Prof. Joel Tropp\, Caltech \nWe introduce a new methodology fo
 r studying the maximum eigenvalue of a sum of independent\, symmetric rand
 om matrices. This approach results in a complete set of extensions to the 
 classical tail bounds associated with the names Azuma\, Bennett\, Bernstei
 n\, Chernoff\, Freedman\, Hoeffding\, and McDiarmid. Results for rectangul
 ar random matrices follow as a corollary. This research is inspired by the
  work of Ahlswede--Winter and Rudelson--Vershynin\, but the new methods yi
 eld essential improvements over earlier results. We believe that these tec
 hniques have the potential to simplify the study a large class of random m
 atrices.
LOCATION:SG 0211 https://plan.epfl.ch/?room==SG%0200211
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR