BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Yusu Wang (UC San Diego - USA)
DTSTART:20210903T150000Z
DTEND:20210903T160000Z
DTSTAMP:20260423T022834Z
UID:GEOTOP-A/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/GEOTOP-A/2/"
 >Persistent Laplacian: properties and algorithms</a>\nby Yusu Wang (UC San
  Diego - USA) as part of GEOTOP-A seminar\n\n\nAbstract\nThe combinatorial
  graph Laplacian\, as an operator on functions defined on the vertex set o
 f a graph\, is a fundamental object in the analysis of and optimization on
  graphs. There is also an algebraic topology view of the graph Laplacian w
 hich arises through considering boundary operators and specific inner prod
 ucts defined on simplicial (co)chain groups. This permits extending the gr
 aph Laplacian to a more general operator\, the q-th combinatorial Laplacia
 n to a given simplicial complex. An extension of this combinatorial Laplac
 ian to the setting of pairs (or more generally\, a sequence of) simplicial
  complexes was recently introduced by (R.) Wang\, Nguyen and Wei. In this 
 talk\, I will present serveral results (including a persistent version of 
 the Cheeger inequality) from our recent study of the theoretical propertie
 s for the persistence Laplacian\, as well as efficient algorithms to compu
 te it. This is joint work with Facundo Memoli and Zhengchao Wan.\n
LOCATION:https://researchseminars.org/talk/GEOTOP-A/2/
END:VEVENT
END:VCALENDAR