Главная
Study mode:
on
1
Intro
2
Vietoris-Rips filtrations
3
Demo: Ripser
4
Ripser A software for computing Vietoris-flips persistence barcodes - about 1000 lines of C++ code, no external dependencies
5
Design goals
6
The four special ingredients
7
Matrix reduction algorithm Setting: finite metric space X, points
8
Compatible basis cycles For a reduced boundary matrix R-D. V, call
9
Persistent cohomology
10
Counting cohomology column reductions
11
Observations
12
Implicit matrix reduction Standard approach
13
Oblivious matrix reduction
14
Natural filtration settings
15
Fundamental theorem of discrete Morse theory Letf be a discrete Morse function on a cell complex K.
16
Morse pairs and persistence pairs
17
Apparent pairs
18
From Morse theory to persistence and back
19
Ripser Live: users from 156 different cities
Description:
Explore efficient computation of Vietoris–Rips persistence barcodes in this 51-minute lecture from the Hausdorff Trimester Program on Applied and Computational Algebraic Topology. Delve into Ripser, a compact C++ software for calculating persistence barcodes, and its design goals. Examine matrix reduction algorithms, persistent cohomology, and the fundamental theorem of discrete Morse theory. Learn about Morse pairs, persistence pairs, and apparent pairs, connecting Morse theory to persistence. Gain insights into Vietoris-Rips filtrations, compatible basis cycles, and oblivious matrix reduction techniques. Witness a live demonstration of Ripser's global reach, showcasing users from 156 different cities.

Ulrich Bauer: Ripser - Efficient Computation of Vietoris–Rips Persistence Barcodes

Hausdorff Center for Mathematics
Add to list
0:00 / 0:00