BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Pierre Pansu (Paris-Saclay)
DTSTART:20231114T140000Z
DTEND:20231114T160000Z
DTSTAMP:20260423T023014Z
UID:WienGAGT/38
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WienGAGT/38/
 ">Computing homology robustly: from persistence to the geometry of normed 
 chain complexes</a>\nby Pierre Pansu (Paris-Saclay) as part of Vienna Geom
 etry and Analysis on Groups Seminar\n\n\nAbstract\nTopological Data Analys
 is uses homology as a feature for large data sets. It has successfully add
 ressed the issue of the robustness of computing homology. Nevertheless\, t
 he conditioning number suggests an alternative approach. When computing th
 e cohomology of a graph (or a simplicial complex)\, it has geometric signi
 ficance: it is known as Cheeger's constant or spectral gap. This indicates
  that (co-)chain complexes contain more information than their mere (co-)h
 omology. We turn the set of normed chain complexes into a metric space and
  study a compactness criterion.\n
LOCATION:https://researchseminars.org/talk/WienGAGT/38/
END:VEVENT
END:VCALENDAR