Explore limit theorems in topological data analysis through this 58-minute lecture by Christian Lehn. Delve into the generalization of barcodes and their application in proving limit theorems for point clouds sampled from unknown distributions. Examine the concept of expectation in random barcodes for fixed point sets, and discover precise asymptotics for uniform distributions on compact submanifolds of R^d. Cover key topics including persistent homology, persistence modules, interval modules, bottleneck metric, barcode maps, random persistence modules, convergence proofs, and continuous maps. Gain insights into this collaborative work with S. Kališnik Verošek and V. Limic, expanding your understanding of advanced concepts in topological data analysis.
Overview
Syllabus
Introduction
Outline
Persistent homology
Persistence modules
Persistence homology
Interval modules
Space of barcodes
bottleneck metric
barcode map
random persistence module
convergence
proof
expectation
continuous maps
Questions
Taught by
Applied Algebraic Topology Network
Related Courses
-
David Meyer - Some Algebraic Stability Theorems for Generalized Persistence Modules
-
Studying Fluid Flows with Persistent Homology - Rachel Levanger
-
On Characterizing Rare Events in Persistent Homology
-
Detecting Bifurcations in Dynamical Systems with Zigzag Persistent Homology
-
Persistence in Functional Topology
