BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1152
DTSTAMP:20230914T125952Z
SUMMARY:Collapses and Persistent Homology
DESCRIPTION:Speaker: Siddharth Pritam (DataShape\, Inria)\n\nAbstract: \nWe
  introduce two new approaches to compute the Persistent Homology (PH) of a
  sequence of simplicial complexes. The basic idea is to simplify the compl
 exes of the input sequence by using special types of collapses (strong and
  edge collapse) and to compute the PH of an induced sequence of smaller si
 ze that has the same PH as the initial one. Our first approach uses strong
  collapse which is introduced by J. Barmak and E.Miniam [DCG (2012)]. Stro
 ng collapse consists of removal of special vertices called dominated verti
 ces from a simplicial complex. In the second approach\, we extend the noti
 ons of dominated vertex to a simplex of any dimension. Domination of edges
  appears to be very powerful and we study it in the case of flag complexes
  in more detail. As a result and as demonstrated by numerous experiments o
 n publicly available data sets\, our approaches are extremely fast and mem
 ory efficient in practice.\n
URL:https://www.tcs.tifr.res.in/web/events/1152
DTSTART;TZID=Asia/Kolkata:20210824T160000
DTEND;TZID=Asia/Kolkata:20210824T170000
END:VEVENT
END:VCALENDAR