BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Ergun Yalcin (Bilkent University) DTSTART:20260330T103000Z DTEND:20260330T113000Z DTSTAMP:20260422T140215Z UID:BilTop/133 DESCRIPTION:Title: Worst-case examples for the computation of persistent homology\nby Er gun Yalcin (Bilkent University) as part of Bilkent Topology Seminar\n\nLec ture held in SA 141.\n\nAbstract\nTopological Data Analysis via persistent homology is a new emerging area of data analysis that uses methods from simplicial topology. The persistent homology of a data set can be calculat ed using a simple algorithm called reduction algorithm.  In this talk\, I will present a new construction of worst-case examples for this algorit hm. Our constructions are similar to the worst-case examples introduced by Morozov\, but replace the single-triangle arrangement with a strip forme d by base and fin triangles. This structure allows us to give an explicit algorithm for their construction and to perform experiments comparing the runtime of different variants of the reduction algorithm.  We further s how that\, after suitable edge and triangle subdivisions\,\nthese strip ex amples remain worst-case and can be realized as clique complexes of filter ed graphs\, and hence as Vietoris--Rips complexes of finite point clouds for a sequence of scale parameters.\n LOCATION:https://researchseminars.org/talk/BilTop/133/ END:VEVENT END:VCALENDAR