Главная
Study mode:
on
1
Introduction
2
Outline
3
Persistent homology
4
Persistence modules
5
Persistence homology
6
Interval modules
7
Space of barcodes
8
bottleneck metric
9
barcode map
10
random persistence module
11
convergence
12
proof
13
expectation
14
continuous maps
15
Questions
Description:
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.

Limit Theorems in Topological Data Analysis

Applied Algebraic Topology Network
Add to list