BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Prof. Rekha R. Thomas (University of Washington)
DTSTART:20220527T040000Z
DTEND:20220527T060000Z
DTSTAMP:20260423T005724Z
UID:tmc-dls/32
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/tmc-dls/32/"
 >Graphical Designs</a>\nby Prof. Rekha R. Thomas (University of Washington
 ) as part of TMC Distinguished Lecture Series\n\n\nAbstract\nA graphical d
 esign on an undirected graph is a quadrature rule in the following sense: 
 Given an eigenbasis of the graph Laplacian\, a design is a collection of v
 ertices of the graph (with weights) so that the weighted average of a coll
 ection of eigenvectors on this subset equals the weighted average on the f
 ull set of vertices. Depending on which eigenvectors are to be averaged\, 
 and requirements on the weights\, one obtains different types of designs. 
 Designs can be computed via linear and integer programming. In this talk I
  will show that positively weighted designs can be organized on the faces 
 of a polytope\, and using this connection\, we compute optimal designs in 
 several graph families. Joint work with Catherine Babecki.\n
LOCATION:https://researchseminars.org/talk/tmc-dls/32/
END:VEVENT
END:VCALENDAR