Professional Documents
Culture Documents
3 Standard Stoppages
Network of Stoppages
Geometric and Topological Data Analysis
Persistent Homology
(beyond linear structure)
(beyond simple connectivity)
Homology
Homology turns topological questions into algebraic questions.
H0
H1
Barcode
Persistence
Diagram
Stability
close close
Data set Persistence diagram
Stability
Metric on Metric on
Data sets Persistence diagram s
Lipschitz
Computing Persistent Homology
Input: Boundary Matrix D
Find V, R such that
D = RV
V is upper-triangular
R is reduced (i.e. no two columns
have lowest nonzeros in the same row)
Ax = b
If A is n x n, consider the n vertex graph with an edge (i,j) for each
nonzero entry A(i, j) of A.
!
Find a vertex separator S such that
- |S| = O(n )
- each connected piece has at most cn vertices (for some c < 1).
!
Repeat. Order the pivots going up from the leaves of the recursion.
The Punchline:
Inverting A can be done in O(n ) time.
Thanks.