BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Uzay Cetin (Bilkent University)
DTSTART:20240304T103000Z
DTEND:20240304T113000Z
DTSTAMP:20260422T135654Z
UID:BilTop/79
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/BilTop/79/">
 TDA II: Matrix Reduction Algorithm and Morozov's Worst Case Example</a>\nb
 y Uzay Cetin (Bilkent University) as part of Bilkent Topology Seminar\n\nL
 ecture held in SB-Z11.\n\nAbstract\nMatrix reduction algorithm on a simpli
 cial complex is a fairly new wave in persistent homology due to its implem
 entations on programs like Ripser and many algorithms that have been built
  upon that. Persistent algorithm dates back to 2002 with a pairing algorit
 hm and its runtime has been shown to be O(N^3). Morozov in his 2005 articl
 e gives an explicit example of the existence of this case. In my talk\, I 
 will talk about the matrix reduction and how it is done\, and explain why 
 the example runs at O(N^3) by combining the logic behind pairing and matri
 x algorithms. After that\, I will also mention an alternative example and 
 in which ways it improves the original example.\n\nPart II of a sequence o
 n Topological Data Analysis (TDA).\n
LOCATION:https://researchseminars.org/talk/BilTop/79/
END:VEVENT
END:VCALENDAR